A065325
78 'Reverse and Add' steps are needed to reach a palindrome.
Original entry on oeis.org
1000689, 1009617, 1010589, 1019517, 1020489, 1029417, 1030389, 1039317, 1040289, 1049217, 1050189, 1059117, 1060089, 1060989, 1069017, 1070889, 1080789, 1090689, 1100679, 1109607, 1110579, 1119507, 1120479, 1129407
Offset: 0
A065326
Numbers such that 79 'Reverse and Add' steps are needed to reach a palindrome.
Original entry on oeis.org
1005744, 1015644, 1025544, 1035444, 1044903, 1045344, 1054803, 1055244, 1064703, 1065144, 1074603, 1075044, 1084503, 1094403, 1105734, 1115634, 1125534, 1135434, 1145334, 1155234, 1165134, 1175034, 1205724, 1215624
Offset: 1
A065327
80 'Reverse and Add' steps are needed to reach a palindrome.
Original entry on oeis.org
1007601, 1017501, 1027401, 1047201, 1057101, 1067001, 2007600, 2017500, 2027400, 2037300, 2047200, 2057100, 2067000, 50003849, 50012849, 50021849, 50030849, 50039849, 50048849, 50057849, 50066849, 50075849, 50084849
Offset: 0
A281301
Trajectory of 1000004999700144385 under the "Reverse and Add!" operation.
Original entry on oeis.org
1000004999700144385, 6834415079694144386, 13668830049399288772, 41457129443403175403, 71914259877895350817, 143719619755790592734, 581014717313707510075, 1151030424627424920260, 1771324671891665221771, 3542550333873429453542, 5996099577656760005995
Offset: 0
a(1) = 1000004999700144385 + 5834410079994000001 = 6834415079694144386.
- Popular Computing (Calabasas, CA), The 196 Problem, Vol. 3 (No. 30, Sep 1975).
- Sergei D. Shchebetov, Table of n, a(n) for n = 0..259
- 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,
A243238,
A281390.
-
NestList[#+IntegerReverse[#]&,1000004999700144385,10] (* Harvey P. Dale, Dec 24 2021 *)
-
terms(n) = my(x=1000004999700144385, i=0); while(1, print1(x, ", "); x=x+eval(concat(Vecrev(Str(x)))); i++; if(i==n, break))
/* Print initial 9 terms as follows: */
terms(9) \\ Felix Fröhlich, Jan 21 2017
A281390
Numbers which require exactly 259 'Reverse and Add' steps to reach a palindrome.
Original entry on oeis.org
1000000079994144385, 1000000089894144385, 1000000099794144385, 1000000179984144385, 1000000189884144385, 1000000199784144385, 1000000279974144385, 1000000289874144385, 1000000299774144385, 1000000379964144385, 1000000389864144385, 1000000399764144385
Offset: 1
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.
- 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
- 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.
A281506
Numbers which require exactly 261 'Reverse and Add' steps to reach a palindrome.
Original entry on oeis.org
1186060307891929990, 1186060317791929990, 1186060327691929990, 1186060337591929990, 1186060347491929990, 1186060357391929990, 1186060367291929990, 1186060377191929990, 1186060387091929990, 1186060407881929990, 1186060417781929990, 1186060427681929990, 1186060437581929990
Offset: 1
Each term requires exactly 261 steps to turn into a 119-digit palindrome, the last term of A281507, 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.
- Sergei D. Shchebetov, 108864 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,
A281507.
A281507
Trajectory of 1186061987030929990 under the "Reverse and Add!" operation.
Original entry on oeis.org
1186061987030929990, 2185352294922536801, 3271704589845072613, 6434410079699144336, 12768830049399288682, 41457129443403175403, 71914259877895350817, 143719619755790592734, 581014717313707510075, 1151030424627424920260, 1771324671891665221771
Offset: 0
a(1) = 1186061987030929990 + 999290307891606811 = 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.
-
k:=1186061987030929990; [n eq 1 select k else Self(n-1) + Seqint(Reverse(Intseq(Self(n-1)))): n in [1..20]]; // Bruno Berselli, Jan 23 2017
-
NestList[#+IntegerReverse[#]&,1186061987030929990,20] (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Jan 17 2019 *)
A066145
In base 2, records for the number of 'Reverse and Add' steps needed to reach a palindrome.
Original entry on oeis.org
0, 1, 2, 4, 5, 11, 21, 32, 37, 46, 48, 49, 53, 89, 99, 142, 147, 273, 297, 345, 515, 550, 573
Offset: 1
Starting with 74, 11 'Reverse and Add' steps are needed to reach a palindrome; starting with n < 74, at most 5 steps are needed.
-
limit = 10^3; (* Assumes that there is no palindrome if none is found before "limit" iterations *)
best = -1; lst = {};
For[n = 0, n <= 10000, n++,
np = n; i = 0;
While[np != IntegerReverse[np, 2] && i < limit,
np = np + IntegerReverse[np, 2]; i++];
If[i < limit && i > best, best = i; AppendTo[lst, i]]]; lst (* Robert Price, Oct 14 2019 *)
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.
A075687
In base 4, records for the number of Reverse and Add! steps needed to reach a palindrome.
Original entry on oeis.org
0, 1, 2, 3, 4, 5, 16, 17, 29, 35, 37, 38, 79, 80, 107
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.
Comments