Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #17 Mar 19 2018 15:43:24
%S 0,11025,19044,21025,24025,32041,38025,42025,47089,51076,58081,59049,
%T 65025,66049,67081,75076,87025,93025,1110916,1140624,1170724,1190281,
%U 1240996,1270129,1290496,1340964,1350244,1380625,1420864,1430416
%N Cyclops squares: squares (A000290) that are also cyclops numbers (A134808).
%H Kenny Lau, <a href="/A160711/b160711.txt">Table of n, a(n) for n = 1..20001</a>
%e 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 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 Select[Range[0, 1200]^2, And[OddQ@ Length@ #, #[[Ceiling[Length[#]/2]]] == 0, Count[#, 0] == 1] &@ IntegerDigits@ # &] (* _Michael De Vlieger_, Jul 08 2016 *)
%t 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 Cf. A000290, A134808, A134809, A134148, A138131, A153806, A160712, A160717, A239828.
%K base,easy,nonn
%O 1,2
%A _Omar E. Pol_, Jun 08 2009