login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 


Product of divisors of n!.
2

%I #20 Jun 25 2022 12:54:47

%S 1,1,2,36,331776,42998169600000000,

%T 7244150201408990671659859968000000000000000,

%U 1182813011613388022005884215741990164001544397058025540221953280041975323323006976000000000000000000000000000000

%N Product of divisors of n!.

%H Matthew Campbell, <a href="/A280420/b280420.txt">Table of n, a(n) for n = 0..10</a>

%F a(n) = A007955(A000142(n)).

%F a(n) = (n!)^(d(n!)/2) = (A000142(n))^(A000005(A000142(n))/2).

%p A280420 := proc(n)

%p mul(d,d=numtheory[divisors](n!)) ;

%p end proc: # _R. J. Mathar_, Jan 04 2017

%t Table[(n!)^(DivisorSigma[0, n!]/2), {n, 0, 10}]

%o (Python)

%o from math import isqrt, factorial

%o from sympy import divisor_count

%o def A280420(n): return (lambda m:isqrt(m)**c if (c:=divisor_count(m)) & 1 else m**(c//2))(factorial(n)) # _Chai Wah Wu_, Jun 25 2022

%Y Cf. A000005, A000142, A007955, A027423.

%K nonn

%O 0,3

%A _Matthew Campbell_, Jan 02 2017

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 September 21 19:38 EDT 2024. Contains 376089 sequences. (Running on oeis4.)