|
Search: id:A062388
|
|
|
| A062388 |
|
Smallest palindrome with digit sum = n. |
|
+0
3
|
|
| 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; listen)
|
|
|
OFFSET
|
0,3
|
|
|
EXAMPLE
|
191 is the smallest palindrome to have digits sum to 11
a(28) = 5995, and no palindrome less than it has digit sum =28.
|
|
CROSSREFS
|
Sequence in context: A122629 A083477 A069510 this_sequence A070244 A102493 A024661
Adjacent sequences: A062385 A062386 A062387 this_sequence A062389 A062390 A062391
|
|
KEYWORD
|
nonn,base,easy
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jun 27 2001
|
|
EXTENSIONS
|
More terms from Erich Friedman (efriedma(AT)stetson.edu), Jul 04 2001
More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Jun 27 2002
|
|
|
Search completed in 0.002 seconds
|
