Numbers using only the curved digits 0, 3, 6, 8 and 9

Open in the 3-D viewerA072960 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,985 |
| Level class, k > L | 13,048 · 13.05 % |
| Weight class, k ≤ L | 86,937 · 86.95 % |
| Ties, k = L | 0 |
| On the level line L = 1 | 6,140 |
| Forced level, l ≤ d² | 264 |
| Range of a(n) | 0 … 33,399,999 |
| Range of the jump d | 1 … 20,000,001 |
| Largest weight k, level L | 33,399,907, 16,699,994 |
16 different gaps occur, from 1 to 20,000,001; the level share is 13.05 %; L = 1 holds 47 % of the level class; there are no ties; 15 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.