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 A160711 #17 Mar 19 2018 15:43:24
%S A160711 0,11025,19044,21025,24025,32041,38025,42025,47089,51076,58081,59049,
%T A160711 65025,66049,67081,75076,87025,93025,1110916,1140624,1170724,1190281,
%U A160711 1240996,1270129,1290496,1340964,1350244,1380625,1420864,1430416
%N A160711 Cyclops squares: squares (A000290) that are also cyclops numbers (A134808).
%H A160711 Kenny Lau, <a href="/A160711/b160711.txt">Table of n, a(n) for n = 1..20001</a>
%e A160711 19044 is in the sequence because it is a square (138^2) and is also a cyclops number (odd number of digits, middle digit is the only zero).
%e A160711 11025 is in the sequence because it is a square (105^2) and is also a cyclops number (odd number of digits, middle digit is the only zero). - _Michael B. Porter_, Jul 09 2016
%t A160711 Select[Range[0, 1200]^2, And[OddQ@ Length@ #, #[[Ceiling[Length[#]/2]]] == 0, Count[#, 0] == 1] &@ IntegerDigits@ # &] (* _Michael De Vlieger_, Jul 08 2016 *)
%t A160711 cnQ[n_]:=Module[{len=IntegerLength[n]},OddQ[len]&&DigitCount[n,10,0]==1 && IntegerDigits[n][[(len+1)/2]]==0]; Join[{0},Select[Range[1200]^2,cnQ]] (* _Harvey P. Dale_, Mar 19 2018 *)
%Y A160711 Cf. A000290, A134808, A134809, A134148, A138131, A153806, A160712, A160717, A239828.
%K A160711 base,easy,nonn
%O A160711 1,2
%A A160711 _Omar E. Pol_, Jun 08 2009