Numbers which have only digits 4 and 5 in base 10

Open in the 3-D viewerA256290 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,985 |
| Level class, k > L | 12,378 · 12.38 % |
| Weight class, k ≤ L | 87,607 · 87.62 % |
| Ties, k = L | 0 |
| On the level line L = 1 | 3,853 |
| Forced level, l ≤ d² | 628 |
| Range of a(n) | 4 … 5,444,455,454,544,445 |
| Range of the jump d | 1 … 3,888,888,888,888,889 |
| Largest weight k, level L | 5,444,455,444,445,453, 1,814,818,484,818,481 |
31 different gaps occur, from 1 to 3,888,888,888,888,889; the level share is 12.38 %; L = 1 holds 31 % 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.