A043269 -id:A043269 - cp's OEIS frontend

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

Amarnath Murthy, Jun 27 2001

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

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

Cf. A043269, A051885.

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

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

More terms from Erich Friedman, Jul 04 2001

More terms from David Wasserman, Jun 27 2002

A113168 a(n) is the sum of digits of the first n palindromes.

Original entry on oeis.org

0, 1, 3, 6, 10, 15, 21, 28, 36, 45, 47, 51, 57, 65, 75, 87, 101, 117, 135, 137, 140, 144, 149, 155, 162, 170, 179, 189, 200, 204, 209, 215, 222, 230, 239, 249, 260, 272, 285, 291, 298, 306, 315, 325, 336, 348, 361, 375, 390, 398, 407, 417, 428, 440, 453, 467, 482, 498

Offset: 1

Giovanni Teofilatto, Jan 06 2006

			First twelve base 10 palindromes are 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 22. Sum of their digits is 0+1+2+3+4+5+6+7+8+9+1+1+2+2 = 51, hence a(12) = 51.

David A. Corneth, Table of n, a(n) for n = 1..10000

Partial sums of A043269.

With[{pals=Select[Range[0,500],#==IntegerReverse[#]&]},Table[ Total[ Flatten[ IntegerDigits/@ Take[ pals, n]]],{n,Length[pals]}]] (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Dec 14 2016 *)

Edited and extended by Klaus Brockhaus, Jan 06 2006

cp's OEIS Frontend

A062388 Smallest palindrome with digit sum = n.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Extensions