Squares written in base 8

Open in the 3-D viewerA002441 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,995 |
| Level class, k > L | 99,995 · 100.00 % |
| Weight class, k ≤ L | 0 · 0.00 % |
| Ties, k = L | 0 |
| On the level line L = 1 | 6,436 |
| Forced level, l ≤ d² | 99,995 |
| Range of a(n) | 1 … 112,402,762,000 |
| Range of the jump d | 3 … 22,222,772,023 |
| Largest weight k, level L | 112,369,416,857, 183,922 |
87,767 different gaps occur, from 3 to 22,222,772,023; every decomposable term is 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.