cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A281509 Trajectory of 1999291987030606810 (the largest presently known "most delayed palindrome") under the "Reverse and Add!" operation.

Original entry on oeis.org

1999291987030606810, 2185352294922536801, 3271704589845072613, 6434410079699144336, 12768830049399288682, 41457129443403175403, 71914259877895350817, 143719619755790592734, 581014717313707510075, 1151030424627424920260, 1771324671891665221771, 3542550333873429453542, 5996099577656760005995
Offset: 0

Views

Author

Andrey S. Shchebetov and Sergei D. Shchebetov, Jan 24 2017

Keywords

Comments

1999291987030606810 is the largest of the 126 presently known numbers that require exactly 261 steps to turn into a palindrome (see A281508). It is also the largest discovered "most delayed palindrome". The sequence reaches a 119-digit palindrome after 261 steps (see b-file). The number was obtained empirically using computer algorithms and was not reported before.

Examples

			a(1) = 1999291987030606810 + 186060307891929991 = 2185352294922536801.
		

References

  • Popular Computing (Calabasas, CA), The 196 Problem, Vol. 3 (No. 30, Sep 1975).

Crossrefs

Formula

a(n+1) = a(n) + rev(a(n)).
a(n) = A281507(n) for n>0. - R. J. Mathar, Jan 27 2017