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 A244573 #9 Mar 13 2021 15:37:18
%S A244573 1,10,18,26,34,42,68,76,84,92,100,279,368,457,546,635,724,813,902,
%T A244573 1000,1071,1152,1233,1314,1486,1567,1648,1729,1981,2051,2132,2213,
%U A244573 2385,2466,2547,2628,2709,2880,2961,3031,3112,3284,3365,3446,3527,3608,3699,3860,3941,4011,4183,4264
%N A244573 Numbers n such that 10*n + d - digsum(10*n + d) is a palindrome for any d in {0,1,2,3,4,5,6,7,8,9}.
%H A244573 Harvey P. Dale, <a href="/A244573/b244573.txt">Table of n, a(n) for n = 1..1000</a>
%e A244573 180 - (1+8+0) = 171, a palindrome. By adding {1,2,3,4,5,6,7,8,9} to 180 and subtracting that number's digsum, it will still be 171, a palindrome. Since 180 = 18*10, 18 is a member of this sequence.
%t A244573 palQ[n_]:=AnyTrue[Table[10n+d-Total[IntegerDigits[10n+d]],{d,0,9}],PalindromeQ]; Select[Range[4300],palQ] (* Requires Mathematica version 10 or later *) (* _Harvey P. Dale_, Mar 13 2021 *)
%o A244573 (PARI) rev(n)={r="";for(i=1,#digits(n),r=concat(Str(digits(n)[i]),r));return(eval(r))}
%o A244573 for(n=1,10^4,s=sum(i=1,#digits(10*n),digits(10*n)[i]);if(rev(10*n-s)==10*n-s,print1(n,", ")))
%Y A244573 Cf. A229621, A066568.
%K A244573 nonn,base
%O A244573 1,2
%A A244573 _Derek Orr_, Jun 30 2014