Numbers congruent to {1, 13} mod 42

Open in the 3-D viewerA146507 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,997 |
| Level class, k > L | 39,827 · 39.83 % |
| Weight class, k ≤ L | 60,170 · 60.17 % |
| Ties, k = L | 79 |
| On the level line L = 1 | 25,951 |
| Forced level, l ≤ d² | 23 |
| Range of a(n) | 1 … 2,099,971 |
| Range of the jump d | 12 … 30 |
| Largest weight k, level L | 2,099,941, 161,515 |
The gaps are 12 and 30; the level share is 39.83 %; L = 1 holds 65 % of the level class.
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.