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!)
A074190 Let the index of the largest prime power that divides n! be k then the smallest number such that n!*a(n) is a perfect k-th power. 0
1, 1, 1, 9, 225, 1125, 385875, 446698546875, 49633171875, 1042296609375, 20311412259610828125, 9031977246542444996484375, 95779597047909624383105541891796875 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
LINKS
FORMULA
If n! = 2^A*3^B*5^C*... then the largest index is A and a(n) = (2*3*5*...)^A/(n!).
EXAMPLE
a(6) = 1125 as 1125*6! = 810000 = 30^4. 6! = 720 = 2^4*3^2*5 and a(6) = (2*3*5)^4/6! = 1125.
MAPLE
for n from 2 to 20 do f := ifactors(n!); k := f[2][1][2]:p := product(f[2][i][1]^k, i=1..nops(f[2])):a[n] := p/n!:od:1, seq(a[j], j=2..20);
MATHEMATICA
a[1]=1; a[n_] := Module[{f}, f=FactorInteger[n! ]; (Times@@First/@f)^f[[1, 2]]/n! ]
CROSSREFS
Sequence in context: A017558 A159939 A167038 * A069075 A218659 A012054
KEYWORD
nonn
AUTHOR
Amarnath Murthy, Aug 31 2002
EXTENSIONS
Corrected and extended by Sascha Kurz, Feb 01 2003
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 June 3 00:27 EDT 2024. Contains 373054 sequences. (Running on oeis4.)