[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
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