login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A056044
Let k be the largest number such that k^2 divides n! and let m be the largest number such that m!^2 divides n!; a(n) = k/m!.
3
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, 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, 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
OFFSET
1,6
LINKS
FORMULA
a(n) = A000188(n!)/A056038(n).
EXAMPLE
For n = 11, 11! = 6! * 6! * 77, so A000188(11!) = A056038(11) = 6! and a(11) = 6!/6! = 1.
MATHEMATICA
f[p_, e_] := p^Floor[e/2]; b[1] = 1; b[n_] := Times @@ f @@@ FactorInteger[n!];
c[n_] := Module[{k = 1}, NestWhile[#/(++k)^2 &, n!, IntegerQ]; (k-1)!];
a[n_] := b[n] / c[n]; Array[a, 100] (* Amiram Eldar, May 24 2024 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Labos Elemer, Jul 25 2000
EXTENSIONS
Name corrected by Amiram Eldar, May 24 2024
STATUS
approved