login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A062388 Smallest palindrome with digit sum = n. 5
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 55, 191, 66, 292, 77, 393, 88, 494, 99, 595, 686, 696, 787, 797, 888, 898, 989, 999, 5995, 19991, 6996, 29992, 7997, 39993, 8998, 49994, 9999, 59995, 69896, 69996, 79897, 79997, 89898, 89998, 99899, 99999, 599995, 1999991 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
EXAMPLE
191 is the smallest palindrome to have digits sum to 11.
a(28) = 5995 and no palindrome less than 5995 has digit sum 28.
PROG
(PARI) ispal(n) = my(d=digits(n)); Vecrev(d)==d;
a(n) = {k = 0; while ((sumdigits(k) != n) || !ispal(k), k++); k; } \\ Michel Marcus, Aug 20 2015
CROSSREFS
Sequence in context: A122629 A083477 A069510 * A070244 A302500 A334542
KEYWORD
nonn,base,easy
AUTHOR
Amarnath Murthy, Jun 27 2001
EXTENSIONS
More terms from Erich Friedman, Jul 04 2001
More terms from David Wasserman, Jun 27 2002
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 04:56 EDT 2024. Contains 371767 sequences. (Running on oeis4.)