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.

A286481 Numbers which require exactly 260 'Reverse and Add' steps to reach a palindrome.

Original entry on oeis.org

1003062289999939142, 1003062299899939142, 1003062389989939142, 1003062399889939142, 1003062489979939142, 1003062499879939142, 1003062589969939142, 1003062599869939142, 1003062689959939142, 1003062699859939142, 1003062789949939142, 1003062799849939142, 1003062889939939142, 1003062899839939142, 1003062989929939142, 1003062999829939142
Offset: 1

Views

Author

Andrey S. Shchebetov and Sergei D. Shchebetov, May 12 2017

Keywords

Comments

The sequence starts with 1003062289999939142 (the 19-digit number discovered by Vaughn Suite on Mar 19 2006) and continues for another 430079 terms (none previously reported) each turning into a 119-digit palindrome after 260 steps until the sequence ends with 3419399999822603000 (see a-file). No further numbers beyond 3419399999822603000 belonging to the same sequence exist. The sequence was predicted theoretically and found empirically using computer modeling algorithms. For the first 100 terms of the sequence see b-file.

Examples

			a(1) = 1003062289999939142 + 2419399999822603001 = 3422462289822542143
		

References

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

Crossrefs

Formula

a(n+1) = a(n) + rev(a(n)).