Numbers using only digits 2 and 3

Open in the 3-D viewerA032810 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,984 |
| Level class, k > L | 12,364 · 12.37 % |
| Weight class, k ≤ L | 87,620 · 87.63 % |
| Ties, k = L | 0 |
| On the level line L = 1 | 3,611 |
| Forced level, l ≤ d² | 628 |
| Range of a(n) | 2 … 3,222,233,232,322,223 |
| Range of the jump d | 1 … 1,888,888,888,888,889 |
| Largest weight k, level L | 3,222,233,223,332,231, 1,074,077,744,107,407 |
31 different gaps occur, from 1 to 1,888,888,888,888,889; the level share is 12.37 %; there are no ties; 16 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.