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.

A090062 There is (presumably) one and only one palindrome in the Reverse and Add! trajectory of n.

Original entry on oeis.org

89, 98, 167, 187, 266, 286, 365, 385, 479, 563, 578, 583, 662, 677, 682, 749, 761, 776, 779, 781, 829, 860, 869, 875, 880, 899, 928, 947, 968, 974, 977, 998, 1077, 1093, 1098, 1167, 1183, 1188, 1257, 1273, 1278, 1297, 1347, 1363, 1368, 1387, 1396, 1397, 1437
Offset: 1

Views

Author

Klaus Brockhaus, Nov 20 2003

Keywords

Comments

For terms < 2000 the only palindrome is reached from the start in at most 24 steps; thereafter no further palindrome is reached in 2000 steps.

Examples

			The trajectory of 479 begins 479, 1453, 4994, 9988, 18887, ...; at 9988 it joins the (presumably) palindrome-free trajectory of A063048(3) = 1997, hence 4994 is the only palindrome in the trajectory of 479 and 479 is a term.
		

Crossrefs