Numbers whose base-3 representation contains no 2

Open in the 3-D viewerA005836 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,983 |
| Level class, k > L | 14,744 · 14.75 % |
| Weight class, k ≤ L | 85,239 · 85.25 % |
| Ties, k = L | 0 |
| On the level line L = 1 | 9,301 |
| Forced level, l ≤ d² | 307 |
| Range of a(n) | 0 … 57,476,668 |
| Range of the jump d | 1 … 21,523,361 |
| Largest weight k, level L | 57,475,421, 28,738,333 |
No digit 2 in base 3: the integers of the Cantor set, and the greedy sequence with no three terms in arithmetic progression. The gaps are (3^j + 1)/2 = 1, 2, 5, 14, ... Level share 14.75 %, and no ties.
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.