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-1 of 1 results.

A265558 a(n) = smallest base-10 palindrome m >= n such that every base-10 digit of n is <= the corresponding digit of m.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 11, 22, 33, 44, 55, 66, 77, 88, 99, 22, 22, 22, 33, 44, 55, 66, 77, 88, 99, 33, 33, 33, 33, 44, 55, 66, 77, 88, 99, 44, 44, 44, 44, 44, 55, 66, 77, 88, 99, 55, 55, 55, 55, 55, 55, 66, 77, 88, 99, 66, 66, 66, 66, 66, 66, 66, 77, 88, 99, 77, 77, 77, 77, 77, 77, 77, 77, 88, 99, 88, 88
Offset: 0

Views

Author

N. J. A. Sloane, Dec 10 2015

Keywords

Crossrefs

Sequences related to palindromic floor and ceiling: A175298, A206913, A206914, A261423, A262038, and the large block of consecutive sequences beginning at A265509.
Cf. A265525.

Programs

  • Maple
    For Maple code see A265543.
  • PARI
    a(n,base=10) = { my (d=digits(n,base)); for (k=1, #d\2, d[k]=d[#d+1-k]=max(d[k],d[#d+1-k])); fromdigits(d,base) } \\ Rémy Sigrist, Jun 24 2022
Showing 1-1 of 1 results.