Multiples of 29

Open in the 3-D viewerA195819 on the OEIS
| Terms | 100,000 (n = 0 … 99,999) |
|---|---|
| Decomposable (a > 2d) | 99,997 |
| Level class, k > L | 9,671 · 9.67 % |
| Weight class, k ≤ L | 90,326 · 90.33 % |
| Ties, k = L | 4 |
| On the level line L = 1 | 10 |
| Forced level, l ≤ d² | 28 |
| Range of a(n) | 0 … 2,899,971 |
| Range of the jump d | 29 … 29 |
| Largest weight k, level L | 99,991, 96,657 |
The gap is always 29; the level share is 9.67 %; L = 29 holds 100 % 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.