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!)
A248772 Greatest 6th-power-free divisor of n!. 4

%I #6 Mar 12 2015 23:27:55

%S 1,2,6,24,120,720,5040,630,5670,56700,623700,7484400,97297200,

%T 1362160800,28028000,7007000,119119000,2144142000,40738698000,

%U 12730843125,267347705625,5881649523750,135277939046250,3246670537110000,5194672859376,135061494343776

%N Greatest 6th-power-free divisor of n!.

%H Clark Kimberling, <a href="/A248772/b248772.txt">Table of n, a(n) for n = 1..1000</a>

%F a(n) = n!/A248770(n).

%e a(8) = 630 because 630 divides 8! and if k > 630 divides 8!, then h^6 divides 8!/k for some h > 1.

%t z = 50; f[n_] := f[n] = FactorInteger[n!]; r[m_, x_] := r[m, x] = m*Floor[x/m];

%t u[n_] := Table[f[n][[i, 1]], {i, 1, Length[f[n]]}];

%t v[n_] := Table[f[n][[i, 2]], {i, 1, Length[f[n]]}];

%t p[m_, n_] := p[m, n] = Product[u[n][[i]]^r[m, v[n]][[i]], {i, 1, Length[f[n]]}];

%t m = 6; Table[p[m, n], {n, 1, z}] (* A248770 *)

%t Table[p[m, n]^(1/m), {n, 1, z}] (* A248771 *)

%t Table[n!/p[m, n], {n, 1, z}] (* A248772 *)

%Y Cf. A248770, A248771, A000142.

%K nonn,easy

%O 1,2

%A _Clark Kimberling_, Oct 14 2014

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 April 26 09:05 EDT 2024. Contains 371991 sequences. (Running on oeis4.)