decompwlj 3D

a(n+1) = a(n) + sum of digits in base 8 representation of a(n)

A010071 on the OEIS · family digit rule

Weight–level plate of a(n+1) = a(n) + sum of digits in base 8 representation of a(n)
Click the plate to explore it in 3-D. Weight k across, level L up, both on log scales: blue in the weight class (k ≤ L), orange in the level class (k > L). The dashed diagonal is k = L.
Open in the 3-D viewerA010071 on the OEIS
Terms100,000 (n = 0 … 99,999)
Decomposable (a > 2d)99,996
Level class, k > L15,936 · 15.94 %
Weight class, k ≤ L84,060 · 84.06 %
Ties, k = L1
On the level line L = 15
Forced level, l ≤ d²9
Range of a(n)1 … 2,289,827
Range of the jump d1 … 44
Largest weight k, level L327,023, 420,252

20 different gaps occur, from 1 to 44; the level share is 15.94 %; L = 7 holds 51 % 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.