login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A371187 Numbers k such that there are no cubefull numbers between k^3 and (k+1)^3. 2
1, 11, 16, 23, 72, 84, 140, 144, 197, 208, 223, 252, 286, 296, 300, 306, 313, 353, 477, 500, 502, 525, 528, 620, 671, 694, 721, 734, 737, 751, 785, 802, 827, 858, 900, 913, 916, 976, 1026, 1056, 1059, 1074, 1080, 1143, 1182, 1197, 1230, 1268, 1281, 1284, 1324 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Positions of 0's in A337736.
This sequence has a positive asymptotic density (Shiu, 1991).
LINKS
P. Shiu, The distribution of cube-full numbers, Glasgow Mathematical Journal, Vol. 33, No. 3 (1991), pp. 287-295.
FORMULA
1 is a term since the two numbers between 1^2 = 1 and (1+1)^2 = 4, 2 and 3, are not cubefull.
MATHEMATICA
cubQ[n_] := (n == 1) || Min @@ FactorInteger[n][[;; , 2]] > 2; Select[Range[1000], ! AnyTrue[Range[#^3 + 1, (# + 1)^3 - 1], cubQ] &]
(* or *)
seq[max_] := Module[{cubs = Union[Flatten[Table[i^5*j^4*k^3, {i, 1, Surd[max, 5]}, {j, 1, Surd[max/i^5, 4]}, {k, Surd[max/(i^5*j^4), 3]}]]], s = {}}, Do[If[IntegerQ[Surd[cubs[[k]], 3]], AppendTo[s, k]], {k, 1, Length[cubs]}]; Position[Differences[s], 1] // Flatten]; seq[10^10]
PROG
(PARI) iscub(n) = n == 1 || vecmin(factor(n)[, 2]) >= 3;
is(n) = for(k = n^3+1, (n+1)^3-1, if(iscub(k), return(0))); 1;
CROSSREFS
Sequence in context: A227080 A131858 A258588 * A110031 A166451 A109307
KEYWORD
nonn
AUTHOR
Amiram Eldar, Mar 14 2024
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 26 04:38 EDT 2024. Contains 375454 sequences. (Running on oeis4.)