Numbers congruent to {17,29} mod 36

Open in the 3-D viewerA259614 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,998 |
| Level class, k > L | 37,212 · 37.21 % |
| Weight class, k ≤ L | 62,786 · 62.79 % |
| Ties, k = L | 0 |
| On the level line L = 1 | 22,538 |
| Forced level, l ≤ d² | 18 |
| Range of a(n) | 17 … 1,799,993 |
| Range of the jump d | 12 … 24 |
| Largest weight k, level L | 1,799,969, 138,437 |
The gaps are 12 and 24; the level share is 37.21 %; L = 1 holds 61 % of the level class; 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.