The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A248762 Greatest cube that divides n!. 5
1, 1, 1, 8, 8, 8, 8, 64, 1728, 1728, 1728, 13824, 13824, 13824, 46656000, 2985984000, 2985984000, 2985984000, 2985984000, 23887872000, 221225582592000, 221225582592000, 221225582592000, 1769804660736000, 221225582592000000, 221225582592000000 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
COMMENTS
Every term divides all its successors.
LINKS
FORMULA
a(n) = n!/A145642(n).
EXAMPLE
a(4) = 8 because 8 divides 24 and if k > 2 then k^3 does not divide 24.
MATHEMATICA
z = 40; f[n_] := f[n] = FactorInteger[n!]; r[m_, x_] := r[m, x] = m*Floor[x/m];
u[n_] := Table[f[n][[i, 1]], {i, 1, Length[f[n]]}];
v[n_] := Table[f[n][[i, 2]], {i, 1, Length[f[n]]}];
p[m_, n_] := p[m, n] = Product[u[n][[i]]^r[m, v[n]][[i]], {i, 1, Length[f[n]]}];
m = 3; Table[p[m, n], {n, 1, z}] (* A248762 *)
Table[p[m, n]^(1/m), {n, 1, z}] (* A248763 *)
Table[n!/p[m, n], {n, 1, z}] (* A145642 *)
gk[n_]:=Select[Divisors[n!], IntegerQ[Surd[#, 3]]&]; Max[#]&/@Array[gk, 30] (* Harvey P. Dale, Sep 16 2021 *)
PROG
(PARI) a(n)=k=ceil((n!/2)^(1/3)); while(n!%k^3, k--); k^3
vector(20, n, a(n)) \\ Derek Orr, Oct 19 2014
CROSSREFS
Sequence in context: A216412 A166082 A145446 * A186985 A203127 A023415
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Oct 14 2014
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 May 20 10:42 EDT 2024. Contains 372712 sequences. (Running on oeis4.)