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”).

A240023
Product of factorials of prime divisors of n (with multiplicity).
1
1, 2, 6, 4, 120, 12, 5040, 8, 36, 240, 39916800, 24, 6227020800, 10080, 720, 16, 355687428096000, 72, 121645100408832000, 480, 30240, 79833600, 25852016738884976640000, 48, 14400, 12454041600, 216, 20160, 8841761993739701954543616000000, 1440
OFFSET
1,2
FORMULA
Completely multiplicative with a(p) = p!.
Sum_{n>=1} 1/a(n) = 1/Product_{p prime} (1 - 1/p!) = 2.42064841562992124691... . - Amiram Eldar, Dec 24 2022
MAPLE
a:= n-> mul(i[1]!^i[2], i=ifactors(n)[2]):
seq(a(n), n=1..30); # Alois P. Heinz, Mar 30 2014
MATHEMATICA
f[p_, e_] := p!^e; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 30] (* Amiram Eldar, Aug 04 2022 *)
PROG
(PARI) a(n)=local(fm=factor(n)); prod(k=1, matsize(fm)[1], fm[k, 1]!^fm[k, 2])
CROSSREFS
Cf. A000142.
Sequence in context: A210420 A306585 A118138 * A004583 A348720 A356476
KEYWORD
nonn,mult
AUTHOR
STATUS
approved