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 A202386 #24 Feb 26 2022 04:23:46
%S A202386 65,5625,6565,50721,65065,71555,75515,84295,541063,557931,650065,
%T A202386 650606,656565,699796,809325,827372,934065,2855182,4637061,4854634,
%U A202386 5791775,5883141,5951693,6129084,6500065,6731076,6752626,6791774,7768827,8084505,9349065
%N A202386 Nonpalindromic numbers m such that the difference between the square of m and the square of the reversal of m is itself a perfect square. Numbers ending in 0 are excluded.
%C A202386 This sequence is infinite because 65*10^k + 65 is a term for all k > 1.
%D A202386 A. H. Beiler, Recreations in the Theory of Numbers, Dover, NY, 1996, p. 147.
%H A202386 Giovanni Resta, <a href="/A202386/b202386.txt">Table of n, a(n) for n = 1..200</a>
%H A202386 Sheng Jiang and Rui-Chen Chen, <a href="https://doi.org/10.1080/0020739980290505">Digits reversed Pythagorean triples</a>, International Journal of Mathematical Education in Science and Technology, volume 29, number 5, 1998, pages 689-696, see type acca-DRPT.
%e A202386 5625 belongs to this sequence because 5625^2 - 5265^2 = 1980^2.
%t A202386 lst = {}; Do[a = n^2; b = FromDigits[Reverse[IntegerDigits[n]]]^2; If[MatchQ[Sqrt[a - b], _Integer] && ! a == b, AppendTo[lst, n]], {n, 85000}]; Select[lst, ! Mod[#, 10] == 0 &]
%o A202386 (PARI) isok(m) = my(r=fromdigits(Vecrev(digits(m)))); (r != m) && (m % 10) && issquare(m^2 - r^2); \\ _Michel Marcus_, Feb 27 2020
%Y A202386 Cf. A000290 (squares), A004086 (digit reversal).
%Y A202386 Cf. A256515 (with abs), A068536 (with addition).
%K A202386 nonn,base
%O A202386 1,1
%A A202386 _Arkadiusz Wesolowski_, Dec 18 2011
%E A202386 Name clarified by _Michel Marcus_, Feb 27 2020