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!)
A308943 a(n) = Product_{d|n} binomial(n,d). 2
1, 2, 3, 24, 5, 1800, 7, 15680, 756, 113400, 11, 79693891200, 13, 4372368, 20495475, 44972928000, 17, 2028339316523520, 19, 52737518268864000, 3247700400, 3585005424, 23, 38135556819759802035135799296, 1328250, 87885070000, 370142004375, 10293527616645873600000, 29 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = Product_{k=1..n} binomial(n,gcd(n,k))^(1/phi(n/gcd(n,k))) = Product_{k=1..n} binomial(n,n/gcd(n,k))^(1/phi(n/gcd(n,k))) where phi = A000010. - Richard L. Ollerton, Nov 08 2021
MATHEMATICA
Table[Product[Binomial[n, d], {d, Divisors[n]}], {n, 1, 29}]
PROG
(PARI) a(n) = my(p=1); fordiv(n, d, p *= binomial(n, d)); p; \\ Michel Marcus, Jul 02 2019
CROSSREFS
Cf. A001142, A008578 (fixed points), A056045 (similar, with Sum), A098710, A135396.
Cf. A000010 (comments on product formulas).
Sequence in context: A037277 A001783 A095996 * A061098 A160630 A119619
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Jul 01 2019
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 April 18 06:24 EDT 2024. Contains 371769 sequences. (Running on oeis4.)