Numbers using only digits 1 and 6

Open in the 3-D viewerA284293 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,969 |
| Level class, k > L | 16,465 · 16.47 % |
| Weight class, k ≤ L | 83,504 · 83.53 % |
| Ties, k = L | 0 |
| On the level line L = 1 | 3,971 |
| Forced level, l ≤ d² | 1,122 |
| Range of a(n) | 1 … 6,111,166,161,611,116 |
| Range of the jump d | 5 … 4,444,444,444,444,445 |
| Largest weight k, level L | 6,111,166,161,160,721, 1,018,527,693,601,851 |
16 different gaps occur, from 5 to 4,444,444,444,444,445; the level share is 16.47 %; 1.1 % of terms are forced level (l <= d^2); there are no ties; 31 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.