A062388 Smallest palindrome with digit sum = n.

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

Author

Amarnath Murthy, Jun 27 2001

Keywords

• nonn
• base
• easy

Examples

			191 is the smallest palindrome to have digits sum to 11.
a(28) = 5995 and no palindrome less than 5995 has digit sum 28.
		

Links

• R. J. Mathar, Table of n, a(n) for n = 0..88

Crossrefs

Cf. A043269, A051885.

Programs

Mathematica

With[{p={#,Total[IntegerDigits[#]]}&/@Select[Range[0,3*10^6],PalindromeQ]},Table[SelectFirst[p,#[[2]]==n&],{n,0,50}]][[;;,1]] (* Harvey P. Dale, Aug 13 2025 *)

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

Extensions

More terms from Erich Friedman, Jul 04 2001

More terms from David Wasserman, Jun 27 2002