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

Open in the 3-D viewerA151984 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,997 |
| Level class, k > L | 27,181 · 27.18 % |
| Weight class, k ≤ L | 72,816 · 72.82 % |
| Ties, k = L | 0 |
| On the level line L = 1 | 7,230 |
| Forced level, l ≤ d² | 61 |
| Range of a(n) | 0 … 3,199,937 |
| Range of the jump d | 1 … 63 |
| Largest weight k, level L | 3,198,719, 1,066,645 |
The gaps are 1 and 63; the level share is 27.18 %; 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.