The OEIS is supported by the many generous donors to the OEIS Foundation.



Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A281390 Numbers which require exactly 259 'Reverse and Add' steps to reach a palindrome. 9
1000000079994144385, 1000000089894144385, 1000000099794144385, 1000000179984144385, 1000000189884144385, 1000000199784144385, 1000000279974144385, 1000000289874144385, 1000000299774144385, 1000000379964144385, 1000000389864144385, 1000000399764144385 (list; graph; refs; listen; history; text; internal format)
The sequence starts with 1000000079994144385 (the 19-digit number discovered by Vaughn Suite on Jul 26 2005 and rediscovered by Jason Doucette on Nov 28 2005) and continues for another 224 terms (none previously reported) each turning into a 119-digit palindrome after 259 steps until the sequence ends with 1000004999700144385. The distance between successive terms in the reported sequence has 9000000 as the greatest common divisor. No further numbers beyond 1000004999700144385 belonging to the same sequence are known, discovered or reported. The sequence was found empirically using computer modeling algorithms.
The sequence was extended to 1620000 terms in total and currently ends with 6834414999700000000 (see a-file). The sequence is complete - no further numbers beyond 6834414999700000000 belonging to the same sequence exist. The sequence was predicted theoretically and found empirically using computer modeling algorithms. - Sergei D. Shchebetov, May 12 2017
Popular Computing (Calabasas, CA), The 196 Problem, Vol. 3 (No. 30, Sep 1975).
Sergei D. Shchebetov, Table of n, a(n) for n = 1..225
Jason Doucette, World Records
Yutaka Nishiyama, Numerical Palindromes and the 196 Problem, International Journal of Pure and Applied Mathematics, Volume 80 No. 3 2012, 375-384.
Sergei D. Shchebetov, 1620000 terms (zipped file)
R. Styer, The Palindromic Conjecture and the Fibonacci Sequence, Villanova University, 1986, 1-11.
C. W. Trigg, Palindromes by Addition, Mathematics Magazine, 40 (1967), 26-28.
C. W. Trigg, More on Palindromes by Reversal-Addition, Mathematics Magazine, 45 (1972), 184-186.
Wikipedia, Lychrel Number
196 and Other Lychrel Numbers, 196 and Lychrel Number
Each term requires exactly 259 steps to turn into a 119-digit palindrome, the last term of A281301, and is separated by some multiples of 9000000 from the adjacent sequence terms.
See also A286481.
Sequence in context: A172546 A256312 A173445 * A281301 A286481 A168334
Andrey S. Shchebetov and Sergei D. Shchebetov, Jan 21 2017

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 9 12:57 EST 2023. Contains 367690 sequences. (Running on oeis4.)