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 A065816 #13 Dec 19 2021 16:54:43
%S A065816 11,22,33,55,66,88,99,110,121,132,165,198,209,220,231,242,264,319,330,
%T A065816 374,385,429,451,462,484,495,506,517,528,550,561,583,605,616,649,660,
%U A065816 671,682,715,737,748,814,836,847,880,891,902,913,924,935,957,990
%N A065816 Numbers k such that the alternating sum of digits of k^2 is 0.
%H A065816 Harry J. Smith, <a href="/A065816/b065816.txt">Table of n, a(n) for n = 1..1000</a>
%t A065816 f[n_] := Block[ {d = Reverse[ IntegerDigits[ n]], k = l = 1, s = 0}, l = Length[d]; While[ k <= l, s = s - (-1)^k*d[[k]]; k++ ]; Return[s]]; Select[ Range[10^3], f[ #^2] == 0 & ]
%t A065816 Select[Range[1000],Total[Times@@@Partition[Riffle[IntegerDigits[#^2],{1,-1},{2,-1,2}],2]]==0&] (* _Harvey P. Dale_, Dec 19 2021 *)
%o A065816 (PARI) SumAD(x)= { local(a=1, s=0); while (x>9, s+=a*(x-10*(x\10)); x\=10; a=-a); return(s + a*x) } { n=0; for (m=1, 10^9, if (SumAD(m^2) == 0, write("b065816.txt", n++, " ", m); if (n==1000, return)) ) } \\ _Harry J. Smith_, Oct 31 2009
%Y A065816 Cf. A065796.
%K A065816 nonn,base
%O A065816 1,1
%A A065816 _Robert G. Wilson v_, Dec 06 2001