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.

Showing 1-9 of 9 results.

A065320 53 'Reverse and Add' steps are needed to reach a palindrome.

Original entry on oeis.org

10677, 11667, 12657, 13647, 14637, 15627, 16617, 17607, 20676, 21666, 22656, 23646, 24636, 25626, 26616, 27606, 30675, 31665, 32655, 33645, 34635, 35625, 36615, 37605, 40674, 41664, 42654, 43644, 44634, 45624, 46614, 47604, 50673
Offset: 1

Views

Author

Klaus Brockhaus, Oct 30 2001

Keywords

Comments

The number of steps starts at 0, so palindromes (cf. A002113) are excluded. 53 is a record (cf. A065199) of the number of 'Reverse and Add' steps needed to reach a palindrome.
The first term not congruent 84 mod 99 is a(64) = 109902, thereafter the residues show no obvious pattern. - Klaus Brockhaus, Jul 14 2003

Crossrefs

Programs

  • Mathematica
    lenQ[n_]:= Length[NestWhileList[# + FromDigits[Reverse[IntegerDigits[#]]]&, n, #! = FromDigits[Reverse[IntegerDigits[#]]]&, 1, 54]] == 54; Select[Range[10000], lenQ] (* Vincenzo Librandi, Sep 24 2013 *)

Extensions

Changed offset from 0 to 1 by Vincenzo Librandi, Sep 24 2013

A065321 Numbers n such that 54 'Reverse and Add' steps are needed to reach a palindrome.

Original entry on oeis.org

10833, 11823, 12813, 13803, 20832, 21822, 22812, 23802, 30831, 31821, 32811, 33801, 40830, 41820, 42810, 43800, 1006804, 1016704, 1026604, 1027920, 1028941, 1036504, 1037820, 1038841, 1046404, 1047720, 1048741, 1048903, 1056304
Offset: 1

Views

Author

Klaus Brockhaus, Oct 30 2001

Keywords

Comments

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

Crossrefs

A065322 55 'Reverse and Add' steps are needed to reach a palindrome.

Original entry on oeis.org

10911, 11901, 20910, 21900, 1009520, 1009601, 1019420, 1019501, 1029320, 1029401, 1039220, 1049120, 1049201, 1059020, 1059101, 1069001, 1108391, 1109510, 1118291, 1119410, 1128191, 1129310, 1138091, 1139210, 1149110
Offset: 0

Views

Author

Klaus Brockhaus, Oct 30 2001

Keywords

Comments

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

Crossrefs

A065323 58 'Reverse and Add' steps are needed to reach a palindrome.

Original entry on oeis.org

147996, 148896, 149796, 157986, 158886, 159786, 167976, 168876, 169776, 177966, 178866, 179766, 187956, 188856, 189756, 190296, 191196, 192096, 197946, 198846, 199746, 247995, 248895, 249795, 257985, 258885, 259785, 267975, 268875, 269775
Offset: 0

Views

Author

Klaus Brockhaus, Oct 30 2001

Keywords

Comments

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

Crossrefs

Programs

A065324 64 'Reverse and Add' steps are needed to reach a palindrome.

Original entry on oeis.org

150296, 151196, 152096, 160286, 161186, 162086, 170276, 171176, 172076, 180266, 181166, 182066, 190256, 191156, 192056, 197996, 198896, 199796, 250295, 251195, 252095, 260285, 261185, 262085, 270275, 271175, 272075, 280265, 281165, 282065
Offset: 0

Views

Author

Klaus Brockhaus, Oct 30 2001

Keywords

Comments

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

Crossrefs

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

A065319 30 'Reverse and Add' steps are needed to reach a palindrome.

Original entry on oeis.org

10548, 11538, 12528, 13518, 14508, 20547, 21537, 22527, 23517, 24507, 30546, 31536, 32526, 33516, 34506, 40545, 40849, 41535, 41839, 42525, 42829, 43515, 43819, 44505, 44809, 44899, 45889, 46879, 47869, 48859, 49849, 50544, 50848
Offset: 1

Views

Author

Klaus Brockhaus, Oct 30 2001

Keywords

Comments

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

Crossrefs

Programs

  • Mathematica
    lenQ[n_]:= Length[NestWhileList[# + FromDigits[Reverse[IntegerDigits[#]]]&, n, #! = FromDigits[Reverse[IntegerDigits[#]]]&, 1, 31]] == 31; Select[Range[10000], lenQ] (* Vincenzo Librandi, Sep 24 2013 *)

Extensions

Changed offset from 0 to 1 by Vincenzo Librandi, Sep 24 2013
Showing 1-9 of 9 results.