|
%I #10 Sep 09 2015 08:20:09
%S 0,1,2,3,4,5,6,7,8,9,55,191,66,292,77,393,88,494,99,595,686,696,787,
%T 797,888,898,989,999,5995,19991,6996,29992,7997,39993,8998,49994,9999,
%U 59995,69896,69996,79897,79997,89898,89998,99899,99999,599995,1999991
%N Smallest palindrome with digit sum = n.
%H R. J. Mathar, <a href="/A062388/b062388.txt">Table of n, a(n) for n = 0..88</a>
%e 191 is the smallest palindrome to have digits sum to 11.
%e a(28) = 5995 and no palindrome less than 5995 has digit sum 28.
%o (PARI) ispal(n) = my(d=digits(n)); Vecrev(d)==d;
%o a(n) = {k = 0; while ((sumdigits(k) != n) || !ispal(k), k++); k;} \\ _Michel Marcus_, Aug 20 2015
%Y Cf. A043269, A051885.
%K nonn,base,easy
%O 0,3
%A _Amarnath Murthy_, Jun 27 2001
%E More terms from _Erich Friedman_, Jul 04 2001
%E More terms from _David Wasserman_, Jun 27 2002
|
