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.

A070244 Largest palindrome using minimum number of digits with a digit sum = n.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 55, 515, 66, 616, 77, 717, 88, 818, 99, 919, 929, 939, 949, 959, 969, 979, 989, 999, 9559, 95159, 9669, 96169, 9779, 97179, 9889, 98189, 9999, 99199, 99299, 99399, 99499, 99599, 99699, 99799, 99899, 99999
Offset: 0

Views

Author

Amarnath Murthy, May 05 2002

Keywords

Comments

No palindrome with lesser number of digits is possible.
All the palindromes using same (minimum) number of digits are smaller than a(n).

Crossrefs

Cf. A062388.

Extensions

a(0)=0 prepended by Michel Marcus, Aug 20 2015