Numbers starting with 1

Open in the 3-D viewerA131835 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,995 |
| Level class, k > L | 8,670 · 8.67 % |
| Weight class, k ≤ L | 91,325 · 91.33 % |
| Ties, k = L | 34 |
| On the level line L = 1 | 8,670 |
| Forced level, l ≤ d² | 0 |
| Range of a(n) | 1 … 188,888 |
| Range of the jump d | 1 … 80,001 |
| Largest weight k, level L | 188,869, 94,443 |
6 different gaps occur, from 1 to 80,001; the level share is 8.67 %; L = 1 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.