Numbers that are congruent to {0, 1} mod 8

Open in the 3-D viewerA047393 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,997 |
| Level class, k > L | 20,802 · 20.80 % |
| Weight class, k ≤ L | 79,195 · 79.20 % |
| Ties, k = L | 0 |
| On the level line L = 1 | 8,491 |
| Forced level, l ≤ d² | 5 |
| Range of a(n) | 0 … 399,993 |
| Range of the jump d | 1 … 7 |
| Largest weight k, level L | 399,983, 133,325 |
The gaps are 1 and 7; the level share is 20.80 %; L = 2 holds 43 % 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.