login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A070244 Largest palindrome using minimum number of digits with a digit sum = n. 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 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

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

CROSSREFS

Cf. A062388.

Sequence in context: A083477 A069510 A062388 * A102493 A024661 A107070

Adjacent sequences:  A070241 A070242 A070243 * A070245 A070246 A070247

KEYWORD

base,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), May 05 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 21:30 EST 2012. Contains 205971 sequences.