Numbers with digits 3 and 4 only

Open in the 3-D viewerA032834 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,985 |
| Level class, k > L | 6,256 · 6.26 % |
| Weight class, k ≤ L | 93,729 · 93.74 % |
| Ties, k = L | 0 |
| On the level line L = 1 | 16 |
| Forced level, l ≤ d² | 628 |
| Range of a(n) | 3 … 4,333,344,343,433,334 |
| Range of the jump d | 1 … 2,888,888,888,888,889 |
| Largest weight k, level L | 2,555,555,555,555,555, 2,166,672,171,716,666 |
31 different gaps occur, from 1 to 2,888,888,888,888,889; the level share is 6.26 %; L = 5 holds 33 % 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.