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 A028817 #15 Oct 12 2019 06:51:49
%S A028817 1,4,9,121,484,676,10201,12321,14641,40804,44944,69696,94249,1002001,
%T A028817 1234321,4008004,5221225,6948496,100020001,102030201,104060401,
%U A028817 121242121,123454321,125686521,400080004,404090404,522808225,617323716,942060249,10000200001
%N A028817 Palindromic squares with an odd number of digits.
%H A028817 Patrick De Geest, <a href="http://www.worldofnumbers.com/subsquar.htm">Subsets of Palindromic Squares</a>
%t A028817 id[n_] := IntegerDigits[n]; palQ[n_] := FromDigits[Reverse[id[n]]] == n; t = {}; Do[If[palQ[x = n^2] && OddQ[Length[id[x]]], AppendTo[t, x]],{n, 101000}]; t (* _Jayanta Basu_, May 13 2013 *)
%t A028817 Select[Range[100000]^2, PalindromeQ[#] && EvenQ[Floor[Log[10, #]]] &] (* _Alonso del Arte_, Oct 11 2019 *)
%o A028817 (Scala) def isPalindromic(n: BigInt): Boolean = n.toString == n.toString.reverse
%o A028817 val squares = ((1: BigInt) to (1000000: BigInt)).map(n => n * n)
%o A028817 squares.filter(n => isPalindromic(n) && n.toString.length % 2 == 1) // _Alonso del Arte_, Oct 07 2019
%Y A028817 Cf. A002779, A028816.
%K A028817 nonn,base
%O A028817 1,2
%A A028817 _Patrick De Geest_