Numbers that are congruent to {11, 17, 29} mod 30

Open in the 3-D viewerA128464 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,998 |
| Level class, k > L | 30,558 · 30.56 % |
| Weight class, k ≤ L | 69,440 · 69.44 % |
| Ties, k = L | 0 |
| On the level line L = 1 | 9,811 |
| Forced level, l ≤ d² | 10 |
| Range of a(n) | 11 … 1,000,001 |
| Range of the jump d | 6 … 12 |
| Largest weight k, level L | 999,917, 142,835 |
The gaps are 6 and 12; the level share is 30.56 %; L = 5 holds 59 % 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.