Numbers with an odd number of digits

Open in the 3-D viewerA001633 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,994 |
| Level class, k > L | 9,192 · 9.19 % |
| Weight class, k ≤ L | 90,802 · 90.81 % |
| Ties, k = L | 48 |
| On the level line L = 1 | 9,192 |
| Forced level, l ≤ d² | 0 |
| Range of a(n) | 0 … 1,009,089 |
| Range of the jump d | 1 … 900,001 |
| Largest weight k, level L | 1,009,061, 504,544 |
The gaps are 1, 91, 9001 and 900001; the level share is 9.19 %; L = 1 holds 100 % of the level class; 6 terms do not decompose.
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.