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.

A015986 Seven iterations of Reverse and Add are needed to reach a palindrome.

Original entry on oeis.org

188, 190, 197, 287, 296, 386, 395, 485, 494, 584, 593, 683, 692, 782, 791, 881, 890, 980, 1394, 1484, 1574, 1664, 1754, 1844, 1898, 1934, 1988, 1992, 1994, 1999, 2393, 2483, 2573, 2663, 2753, 2843, 2897, 2933, 2987, 2991, 2993, 2998
Offset: 0

Views

Author

Keywords

Comments

The number of iterations starts at 1, so palindromes (cf. A002113) are not excluded. The corresponding sequence excluding palindromes is A065212.

Crossrefs

Programs

  • Mathematica
    sirapQ[n_]:=Boole[PalindromeQ/@Rest[NestList[#+IntegerReverse[#]&,n,7]]]=={0,0,0,0,0,0,1}; Select[Range[3000],sirapQ] (* Harvey P. Dale, May 11 2025 *)