Multiples of 31

Open in the 3-D viewerA135631 on the OEIS
| Terms | 100,000 (n = 0 … 99,999) |
|---|---|
| Decomposable (a > 2d) | 99,997 |
| Level class, k > L | 9,683 · 9.68 % |
| Weight class, k ≤ L | 90,314 · 90.32 % |
| Ties, k = L | 4 |
| On the level line L = 1 | 11 |
| Forced level, l ≤ d² | 30 |
| Range of a(n) | 0 … 3,099,969 |
| Range of the jump d | 31 … 31 |
| Largest weight k, level L | 99,991, 96,844 |
The gap is always 31; the level share is 9.68 %; L = 31 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.