Every base 3 digit of n is a base 10 digit of n

Open in the 3-D viewerA037386 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,995 |
| Level class, k > L | 14,134 · 14.13 % |
| Weight class, k ≤ L | 85,861 · 85.87 % |
| Ties, k = L | 17 |
| On the level line L = 1 | 6,830 |
| Forced level, l ≤ d² | 228 |
| Range of a(n) | 1 … 1,079,821 |
| Range of the jump d | 1 … 802 |
| Largest weight k, level L | 1,079,621, 539,910 |
150 different gaps occur, from 1 to 802; the level share is 14.13 %; L = 1 holds 48 % 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.