Numbers that are congruent to {5, 30} mod 37

Open in the 3-D viewerA169610 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,998 |
| Level class, k > L | 29,488 · 29.49 % |
| Weight class, k ≤ L | 70,510 · 70.51 % |
| Ties, k = L | 0 |
| On the level line L = 1 | 7,724 |
| Forced level, l ≤ d² | 20 |
| Range of a(n) | 5 … 1,849,993 |
| Range of the jump d | 12 … 25 |
| Largest weight k, level L | 1,849,759, 142,292 |
The gaps are 12 and 25; the level share is 29.49 %; there are no ties.
The decomposition
Every term of a strictly increasing sequence is written a(n) = k(n)·L(n) + d(n): the jump d = a(n+1) − a(n), the weight k the least divisor of a − d greater than d, the level L = (a − d)/k. A term decomposes when a > 2d; it is in the level class when k > L and in the weight class when k ≤ L. See decompwlj.com and arXiv:0711.0865, or how it works, with worked examples and a live one.