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 A085932 #21 May 12 2024 11:43:25
%S A085932 1,2,3,4,10,20,30,40,100,124,129,142,148,167,176,184,192,200,214,219,
%T A085932 224,229,241,242,248,267,276,284,291,292,300,348,367,376,384,400,412,
%U A085932 418,421,422,428,438,448,467,476,481,482,483,484,567,576,617,627,637
%N A085932 Numbers k such that (digits of k sorted in ascending order) + (digital sum of k) is a palindrome.
%C A085932 Essentially all terms can be generated by going over A009994. By permuting digits and including any number of 0's in any term that is in A009994 any term in this sequence can be found. For example, from 124 we find that 412, 1402, 200004001 are terms. - _David A. Corneth_, Apr 20 2024
%H A085932 David A. Corneth, <a href="/A085932/b085932.txt">Table of n, a(n) for n = 1..10000</a>
%e A085932 142 is a term because the digits of 142 in ascending order are 124, the digital sum of 124 is 7, and 124 + 7 = 131, a palindrome.
%t A085932 dspQ[n_]:=Module[{sidn=Sort[IntegerDigits[n]],pidn},pidn= IntegerDigits[ FromDigits[ sidn]+ Total[ sidn]]; pidn==Reverse[pidn]]; Select[Range[ 700], dspQ] (* _Harvey P. Dale_, Jul 19 2011 *)
%Y A085932 Cf. A009994, A085933, A085934, A085935.
%K A085932 nonn,easy,base
%O A085932 1,2
%A A085932 _Jason Earls_ and _Amarnath Murthy_, Jul 14 2003