cp's OEIS Frontend

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.

A239590 Numbers whose cubes are cyclops numbers.

This page as a plain text file.
%I A239590 #14 Nov 05 2024 16:45:24
%S A239590 0,42,115,116,123,135,163,164,199,498,525,557,562,564,576,579,596,615,
%T A239590 623,642,661,666,695,697,717,721,724,748,788,806,827,886,945,961,994,
%U A239590 2272,2274,2319,2325,2329,2391,2438,2512,2529,2537,2545,2617,2637,2654
%N A239590 Numbers whose cubes are cyclops numbers.
%H A239590 Colin Barker, <a href="/A239590/b239590.txt">Table of n, a(n) for n = 1..1500</a>
%e A239590 123 is in the sequence because 123^3 = 1860867, which is a cyclops number.
%t A239590 Join[{0},Select[Range[0,3000],OddQ[IntegerLength[#^3]]&&DigitCount[#^3,10,0]==1&&IntegerDigits[#^3][[(IntegerLength[ #^3]+ 1)/2]] == 0&]] (* _Harvey P. Dale_, Nov 05 2024 *)
%o A239590 (PARI)
%o A239590 is_cyclops(k) = {
%o A239590   if(k==0, return(1));
%o A239590   my(d=digits(k), j);
%o A239590   if(#d%2==0 || d[#d\2+1]!=0, return(0));
%o A239590   for(j=1, #d\2, if(d[j]==0, return(0)));
%o A239590   for(j=#d\2+2, #d, if(d[j]==0, return(0)));
%o A239590   return(1)}
%o A239590 s=[]; for(n=0, 3000, if(is_cyclops(n^3), s=concat(s, n))); s
%Y A239590 Cf. A000578, A134808, A160711, A239587, A239588, A239589, A239591.
%K A239590 nonn,base
%O A239590 1,2
%A A239590 _Colin Barker_, Mar 24 2014