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 A239587 #16 Nov 05 2024 18:08:41 %S A239587 0,74088,1520875,1560896,1860867,2460375,4330747,4410944,7880599, %T A239587 123505992,144703125,172808693,177504328,179406144,191102976, %U A239587 194104539,211708736,232608375,241804367,264609288,288804781,295408296,335702375,338608873,368601813,374805361 %N A239587 Cubes that are cyclops numbers. %C A239587 Intersection of A000578 (Cubes) and A134808 (Cyclops numbers). %H A239587 Colin Barker, <a href="/A239587/b239587.txt">Table of n, a(n) for n = 1..1800</a> %F A239587 a(n) = A239590(n)^3. %t A239587 cyclpsQ[n_]:=With[{len=IntegerLength[n]},OddQ[len]&&DigitCount[n,10,0]==1&&IntegerDigits[n][[(len+1)/2]]==0]; Join[{0},Select[ Range[ 800]^3,cyclpsQ]] (* _Harvey P. Dale_, Nov 05 2024 *) %o A239587 (PARI) %o A239587 is_cyclops(k) = { %o A239587 if(k==0, return(1)); %o A239587 my(d=digits(k), j); %o A239587 if(#d%2==0 || d[#d\2+1]!=0, return(0)); %o A239587 for(j=1, #d\2, if(d[j]==0, return(0))); %o A239587 for(j=#d\2+2, #d, if(d[j]==0, return(0))); %o A239587 return(1)} %o A239587 s=[]; for(n=0, 2000, if(is_cyclops(n^3), s=concat(s, n^3))); s %Y A239587 Cf. A000578, A134808, A160711, A239588, A239589, A239590, A239591. %K A239587 nonn,base %O A239587 1,2 %A A239587 _Colin Barker_, Mar 24 2014