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 A239828 #6 Mar 27 2014 18:40:02
%S A239828 0,11025,42025,93025,121308196,121506529,121903681,122301481,
%T A239828 144408289,144504441,145106116,145805625,145902241,169702729,
%U A239828 169806961,171505216,196308121,196504324,197205849,197908624,198105625,198302724,256608361,256704484,257409936
%N A239828 Cyclops numbers which are squares of cyclops numbers.
%C A239828 Subsequence of A160711.
%H A239828 Giovanni Resta, <a href="/A239828/b239828.txt">Table of n, a(n) for n = 1..10000</a>
%F A239828 a(n) = A239827(n)^2.
%e A239828 145106116 is in the sequence because 145106116 = 12046^2, and both 145106116 and 12046 are cyclops numbers.
%o A239828 (PARI)
%o A239828 is_cyclops(k) = {
%o A239828 if(k==0, return(1));
%o A239828 my(d=digits(k), j);
%o A239828 if(#d%2==0 || d[#d\2+1]!=0, return(0));
%o A239828 for(j=1, #d\2, if(d[j]==0, return(0)));
%o A239828 for(j=#d\2+2, #d, if(d[j]==0, return(0)));
%o A239828 return(1)}
%o A239828 s=[]; for(n=0, 100000, if(is_cyclops(n) && is_cyclops(n^2), s=concat(s, n^2))); s
%Y A239828 Cf. A134808, A160711, A239827.
%K A239828 nonn,base
%O A239828 1,2
%A A239828 _Colin Barker_, Mar 27 2014