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.

A262223 a(n) = n + largest palindrome contained in decimal representation of n.

Original entry on oeis.org

0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 11, 22, 14, 16, 18, 20, 22, 24, 26, 28, 22, 23, 44, 26, 28, 30, 32, 34, 36, 38, 33, 34, 35, 66, 38, 40, 42, 44, 46, 48, 44, 45, 46, 47, 88, 50, 52, 54, 56, 58, 55, 56, 57, 58, 59, 110, 62, 64, 66, 68, 66, 67, 68, 69, 70, 71
Offset: 0

Views

Author

Reinhard Zumkeller, Sep 15 2015

Keywords

Comments

a(n) = n + A047813(n).

Crossrefs

Cf. A047813, A262224 (iteration, start = 1).

Programs

  • Haskell
    a262223 n = n + a047813 n