The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A056044 Let k be largest number such that k^2 divides n! and let m be largest number such that m! divides k; a(n) = k/m!. 2

%I

%S 1,1,1,1,1,2,2,1,3,1,1,2,2,2,6,3,3,2,2,2,2,2,2,2,10,10,30,2,2,12,12,3,

%T 3,6,30,10,10,10,30,6,6,2,2,2,30,60,60,30,210,42,42,42,42,1,1,2,2,4,4,

%U 4,4,4,84,21,21,14,14,14,42,6,6,2,2,2,10,10,70,140,140,14,126,3,3,6,30

%N Let k be largest number such that k^2 divides n! and let m be largest number such that m! divides k; a(n) = k/m!.

%F a(n)=A000188(n!)/H!, where H!>=Floor[n/2]! is here the maximal factorial divisor.

%e n=11, 11!=6!*6!*77 and the largest square root divisor is 6!>Floor[11/2]! a(11)=77, the quotient.

%Y A000142, A000188, A055772, A001405, A001057.

%K nonn

%O 1,6

%A _Labos Elemer_, Jul 25 2000

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

Last modified September 30 05:01 EDT 2020. Contains 337435 sequences. (Running on oeis4.)