Numbers that are palindromic in base 11

Open in the 3-D viewerA029956 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,995 |
| Level class, k > L | 75,409 · 75.41 % |
| Weight class, k ≤ L | 24,586 · 24.59 % |
| Ties, k = L | 13 |
| On the level line L = 1 | 4,800 |
| Forced level, l ≤ d² | 13,564 |
| Range of a(n) | 0 … 1,249,746,668 |
| Range of the jump d | 1 … 15,972 |
| Largest weight k, level L | 1,249,319,417, 82,445,722 |
10 different gaps occur, from 1 to 15,972; the level share is 75.41 %; 13.6 % of terms are forced level (l <= d^2).
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.