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.

Previous Showing 11-20 of 34 results. Next

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

Views

Author

Klaus Brockhaus, Oct 30 2001

Keywords

Comments

The number of steps starts at 0, so palindromes (cf. A002113) are excluded. 78 is a record (cf. A065199) of the number of 'Reverse and Add' steps needed to reach a palindrome.
First term not congruent to 15 mod 18 is a(135) = 2000688, thereafter residues 6 and 15 appear in larger clusters; first residue different from 15 and 6 is at a(1215) = 16902780. - Klaus Brockhaus, Jul 14 2003

Crossrefs

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

Views

Author

Klaus Brockhaus, Oct 30 2001

Keywords

Comments

The number of steps starts at 0, so palindromes (cf. A002113) are excluded. 79 is a record (cf. A065199) of the number of 'Reverse and Add' steps needed to reach a palindrome.

Crossrefs

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

Views

Author

Klaus Brockhaus, Oct 31 2001

Keywords

Comments

The number of steps starts at 0, so palindromes (cf. A002113) are excluded. 80 is a record (cf. A065199) for the number of 'Reverse and Add' steps needed to reach a palindrome.

Crossrefs

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

Views

Author

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

Keywords

Comments

1000004999700144385 is the largest of the first 225 numbers that require exactly 259 steps to turn into a palindrome (see A281390). The sequence reaches a 119-digit palindrome after 259 steps (see b-file). The number was obtained empirically using computer algorithms and was not reported before.
Row 1000004999700144385 of the array in A243238. - Felix Fröhlich, Jan 21 2017

Examples

			a(1) = 1000004999700144385 + 5834410079994000001 = 6834415079694144386.
		

References

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

Crossrefs

Programs

  • Mathematica
    NestList[#+IntegerReverse[#]&,1000004999700144385,10] (* Harvey P. Dale, Dec 24 2021 *)
  • PARI
    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

Formula

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

Extensions

a(9)-a(10) from 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

Views

Author

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

Keywords

Comments

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

Examples

			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.
		

References

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

Crossrefs

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

Views

Author

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

Keywords

Comments

The sequence starts with 1186060307891929990 (the 19-digit number also known as "the most delayed palindrome" and claimed as the world record, discovered by Jason Doucette on Nov 30 2005 and rediscovered by Vaughn Suite on Jan 02 2006) and continues for another 125 terms (none previously reported) each turning into a 119-digit palindrome after 261 steps until the sequence ends with 1186061987030929990. The distance between successive terms in the reported sequence has 9000000 as the greatest common divisor. No further numbers beyond 1186061987030929990 belonging to the same sequence are known, discovered or reported. The sequence was found empirically using computer modeling algorithms.
The sequence was extended to 108864 terms in total and ends with 1999291987030606810 - the last term of A281508 (see a-file). The sequence is complete - no further numbers beyond 1999291987030606810 belonging to the same sequence exist. The sequence was predicted theoretically and found empirically using computer modeling algorithms. - Sergei D. Shchebetov, May 12 2017
Comments from Sergei D. Shchebetov, Nov 14 2019: (Start)
There are two reasons that 1186060307891929990 cannot be the smallest term.
(1) Empirical: All numbers below were tested and none was found to have 261 (or higher) steps delay. This is presented, for example, in the Doucette link.
(2) Theoretical: There is no other combinations of the digits at 1186060307891929990 that gives you a lower number with the same reverse-and-sum result after the first step. This is because the number starts with 1 and you cannot go below 1 for the largest digit. Then it has 9s as the last 3 smallest digits and you cannot go up from there, but you could go down for the smallest digits (meaning up for the largest). For example, 1286060307891929980 (look at changes in the second digit from both ends: 1 turns into 2 and 9 turns into 8 with the sum staying 10 in both cases) would have the same 261-step delay. Same is with 1386060307891929970, etc. If you calculate all possible combinations where the pairwise sum of the digits stays the same, you will get 108864 terms.
Also, since 2005, when 1186060307891929990 was discovered, people have checked all numbers up to 23-digit range and found none (except for our set) with 261-step (or higher) delays. So finding a number with a 288-step delay, as Rob van Nobelen did, was a real breakthrough.
(End)

Examples

			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.
		

References

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

Crossrefs

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

Views

Author

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

Keywords

Comments

1186061987030929990 is the largest of the first 126 numbers that require exactly 261 steps to turn into a palindrome (see A281506). 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) = 1186061987030929990 + 999290307891606811 = 2185352294922536801.
		

References

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

Crossrefs

Programs

  • Magma
    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
  • Mathematica
    NestList[#+IntegerReverse[#]&,1186061987030929990,20] (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Jan 17 2019 *)

Formula

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

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

Views

Author

Klaus Brockhaus, Dec 08 2001

Keywords

Comments

The analog of A065199 in base 2. A066144 gives the corresponding starting points.
Terms a(19..22) obtained by assuming that a(n+1) <= a(n) + 300. - A.H.M. Smeets, Apr 30 2022

Examples

			Starting with 74, 11 'Reverse and Add' steps are needed to reach a palindrome; starting with n < 74, at most 5 steps are needed.
		

Crossrefs

Record values in base b: A077407 (b=3), A075687 (b=4), A306600 (b=8), A065199 (b=10), A348572 (Zeckendorf).

Programs

  • Mathematica
    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 *)

Extensions

Offset corrected and a(19)-a(23) by A.H.M. Smeets, Apr 30 2022

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

Views

Author

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

Keywords

Comments

The sequence starts with 1999290307891606810 and continues for another 125 terms (none previously reported, including the first term) each turning into a 119-digit palindrome after 261 steps until the sequence ends with 1999291987030606810. The distance between successive terms in the reported sequence has 9000000 as the greatest common divisor. No further numbers beyond 1999291987030606810 belonging to the same sequence are known, discovered or reported. Moreover, 1999291987030606810 is currently the largest discovered "most delayed palindrome". The sequence was found empirically using computer modeling algorithms.
It is only a conjecture that there are no further terms. - N. J. A. Sloane, Jan 24 2017

Examples

			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.
		

References

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

Crossrefs

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

Views

Author

Klaus Brockhaus, Sep 24 2002

Keywords

Comments

RECORDS transform of A075685. Base-4 analog of A065199 (base 10) and A066145 (base 2). A075686 gives the corresponding starting points.

Examples

			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.
		

Crossrefs

Previous Showing 11-20 of 34 results. Next