Numbers with digitsum 13, in increasing order

Open in the 3-D viewerA143164 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 100,000 |
| Level class, k > L | 30,901 · 30.90 % |
| Weight class, k ≤ L | 69,099 · 69.10 % |
| Ties, k = L | 3 |
| On the level line L = 1 | 7,443 |
| Forced level, l ≤ d² | 2,163 |
| Range of a(n) | 49 … 111,032,122 |
| Range of the jump d | 9 … 6,000,039 |
| Largest weight k, level L | 111,032,113, 11,101,000 |
69 different gaps occur, from 9 to 6,000,039; the level share is 30.90 %; 2.2 % of terms are forced level (l <= d^2).
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.