This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A062388 #12 Aug 13 2025 16:47:58
%S A062388 0,1,2,3,4,5,6,7,8,9,55,191,66,292,77,393,88,494,99,595,686,696,787,
%T A062388 797,888,898,989,999,5995,19991,6996,29992,7997,39993,8998,49994,9999,
%U A062388 59995,69896,69996,79897,79997,89898,89998,99899,99999,599995,1999991
%N A062388 Smallest palindrome with digit sum = n.
%H A062388 R. J. Mathar, <a href="/A062388/b062388.txt">Table of n, a(n) for n = 0..88</a>
%e A062388 191 is the smallest palindrome to have digits sum to 11.
%e A062388 a(28) = 5995 and no palindrome less than 5995 has digit sum 28.
%t A062388 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 *)
%o A062388 (PARI) ispal(n) = my(d=digits(n)); Vecrev(d)==d;
%o A062388 a(n) = {k = 0; while ((sumdigits(k) != n) || !ispal(k), k++); k;} \\ _Michel Marcus_, Aug 20 2015
%Y A062388 Cf. A043269, A051885.
%K A062388 nonn,base,easy
%O A062388 0,3
%A A062388 _Amarnath Murthy_, Jun 27 2001
%E A062388 More terms from _Erich Friedman_, Jul 04 2001
%E A062388 More terms from _David Wasserman_, Jun 27 2002