A281508
Numbers requiring exactly 261 'Reverse and Add' steps to reach a palindrome.
Original entry on oeis.org
1999290307891606810, 1999290317791606810, 1999290327691606810, 1999290337591606810, 1999290347491606810, 1999290357391606810, 1999290367291606810, 1999290377191606810, 1999290387091606810, 1999290407881606810, 1999290417781606810, 1999290427681606810, 1999290437581606810
Offset: 1
Each term requires exactly 261 steps to turn into a 119-digit palindrome, the last term of A281509, and is separated by some multiples of 9000000 from the adjacent sequence terms.
- Popular Computing (Calabasas, CA), The 196 Problem, Vol. 3 (No. 30, Sep 1975).
- Sergei D. Shchebetov, Table of n, a(n) for n = 1..126
- 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.
- 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
- Index entries for sequences related to Reverse and Add!
Cf.
A023109,
A033672,
A065198,
A065199,
A065320,
A065321,
A065322,
A065323,
A065324,
A065325,
A065326,
A065327,
A070743,
A072216,
A072217,
A072218,
A281301,
A281390,
A281506,
A281507.
A075686
In base 4, n sets a new record for the number of Reverse and Add! steps needed to reach a palindrome starting with n.
Original entry on oeis.org
0, 4, 7, 26, 28, 127, 199, 296, 511, 3119, 16861, 18164, 19453, 20468, 270824
Offset: 0
Starting with 26, 3 Reverse and Add! steps are needed to reach a palindrome; starting with n < 26, less (at most 2) steps are needed.
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
a(1) = 1999291987030606810 + 186060307891929991 = 2185352294922536801.
- Popular Computing (Calabasas, CA), The 196 Problem, Vol. 3 (No. 30, Sep 1975).
- Sergei D. Shchebetov, Table of n, a(n) for n = 0..261
- 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.
- 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
- Index entries for sequences related to Reverse and Add!
Cf.
A023109,
A033672,
A065198,
A065199,
A065320,
A065321,
A065322,
A065323,
A065324,
A065325,
A065326,
A065327,
A070743,
A072216,
A072217,
A072218,
A281301,
A281390,
A281506,
A281507,
A281508.
A306599
In base 8: a(n) sets a new record for the number of Reverse and Add! steps needed to reach a palindrome starting with a(n).
Original entry on oeis.org
0, 8, 15, 39, 47, 109, 375, 1591, 4470, 4596, 6393, 6718, 7930, 16439, 28903, 34292, 49465, 264496, 265750, 266126, 311290, 2067455, 16808764, 18276328, 1074296036, 1075478361
Offset: 0
A306600
In base 8, records for the number of 'Reverse and Add' steps needed to reach a palindrome.
Original entry on oeis.org
0, 1, 2, 3, 6, 14, 17, 19, 21, 22, 23, 29, 30, 36, 46, 59, 60, 64, 67, 94, 95, 97, 120, 122, 133, 164
Offset: 0
A326414
Numbers which require exactly 288 'Reverse and Add' steps to reach a palindrome.
Original entry on oeis.org
12000700000025339936491, 12000700001015339936491, 12000700002005339936491, 12000700010024339936491, 12000700011014339936491, 12000700012004339936491, 12000700020023339936491, 12000700021013339936491, 12000700022003339936491, 12000700030022339936491
Offset: 1
- Popular Computing (Calabasas, CA), The 196 Problem, Vol. 3 (No. 30, Sep 1975).
- Sergei D. Shchebetov, Table of n, a(n) for n = 1..10000
- 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, 19353600 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
- Index entries for sequences related to Reverse and Add!
Cf.
A023109,
A033672,
A065198,
A065199,
A065320,
A065321,
A065322,
A065323,
A065324,
A065325,
A065326,
A065327,
A070743,
A072216,
A072217,
A072218,
A281301,
A281390,
A281506,
A281507.
Deleted an erroneous comment that said that the sequence was finite. -
N. J. A. Sloane, Jun 23 2022
A077406
In base 3: n sets a new record for the number of Reverse and Add! steps needed to reach a palindrome starting with n.
Original entry on oeis.org
0, 3, 5, 15, 17, 53, 1466, 9717, 32857, 37340, 37366, 37367, 531773, 1596329
Offset: 1
Starting with 15, 3 Reverse and Add! steps are needed to reach a palindrome; starting with n < 15, less (at most 2) steps are needed.
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
a(1) = 1003062289999939142 + 2419399999822603001 = 3422462289822542143
- Popular Computing (Calabasas, CA), The 196 Problem, Vol. 3 (No. 30, Sep 1975).
- Sergei D. Shchebetov, Table of n, a(n) for n = 1..99
- 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, 430080 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
- Index entries for sequences related to Reverse and Add!
Cf.
A023109,
A033672,
A065198,
A065199,
A065320,
A065321,
A065322,
A065323,
A065324,
A065325,
A065326,
A065327,
A070743,
A072216,
A072217,
A072218,
A281301,
A281390,
A281506,
A281507,
A281508,
A281509.
A323975
a(n) sets a new record for the Lychrel number a(n) of 'Reverse and Add' steps, needed to reach a Lychrel number m < a(n) (i.e., its seed).
Original entry on oeis.org
195, 295, 4799, 10653, 10821, 14995, 105985, 1005523, 1008927, 1009413, 1029983
Offset: 1
A323976
Records for the number of 'Reverse and Add' steps, needed for a Lychrel number to join the trajectory of a smaller Lychrel number (i.e., its seed).
Original entry on oeis.org
0, 1, 2, 4, 5, 8, 10, 12, 14, 15, 19
Offset: 1
Comments