decompwlj 3D

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

A015979 on the OEIS · family digit rule

Weight–level plate of Three 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 viewerA015979 on the OEIS
Terms100,000 (n = 1 … 100,000)
Decomposable (a > 2d)99,999
Level class, k > L16,195 · 16.20 %
Weight class, k ≤ L83,804 · 83.80 %
Ties, k = L23
On the level line L = 18,127
Forced level, l ≤ d²35
Range of a(n)59 … 797,322
Range of the jump d1 … 405
Largest weight k, level L797,309, 398,655

153 different gaps occur, from 1 to 405; the level share is 16.20 %; L = 1 holds 50 % 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.