Positive numbers k such that every base-2 digit of k is a base-3 digit of k

Open in the 3-D viewerA037372 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,998 |
| Level class, k > L | 9,481 · 9.48 % |
| Weight class, k ≤ L | 90,517 · 90.52 % |
| Ties, k = L | 52 |
| On the level line L = 1 | 9,369 |
| Forced level, l ≤ d² | 3 |
| Range of a(n) | 1 … 103,568 |
| Range of the jump d | 1 … 6 |
| Largest weight k, level L | 103,567, 51,783 |
5 different gaps occur, from 1 to 6; the level share is 9.48 %; L = 1 holds 99 % of the level class.
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.