decompwlj 3D

Five iterations of Reverse and Add are needed to reach a palindrome

A015982 on the OEIS · family digit rule

Weight–level plate of Five iterations of Reverse and Add are needed to reach a palindrome
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 viewerA015982 on the OEIS
Terms100,000 (n = 1 … 100,000)
Decomposable (a > 2d)100,000
Level class, k > L21,000 · 21.00 %
Weight class, k ≤ L79,000 · 79.00 %
Ties, k = L11
On the level line L = 16,475
Forced level, l ≤ d²50
Range of a(n)166 … 1,372,071
Range of the jump d1 … 839
Largest weight k, level L1,371,947, 685,978

217 different gaps occur, from 1 to 839; the level share is 21.00 %; L = 1 holds 31 % 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.