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!)
A129364 a(n) = Product_{k = 1..n} A066841(k). 3
1, 2, 6, 96, 480, 207360, 1451520, 2972712960, 722369249280, 5778953994240000, 63568493936640000, 9111096278347394580480000, 118444251618516129546240000, 10400352846118664303196241920000 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Conjecture: a(n) divides A092287(n) for all n - see comments in A129365.
LINKS
FORMULA
a(n) = Product_{k = 1..n} Product_{d|k} d^(k/d).
a(n) = Product_{k = 1..n} ((floor(n/k))!)^k.
a(n) = exp(Sum_{k = 1..n} log(k)/2 * floor(n/k) * floor(1 + n/k)). - Daniel Suteu, Sep 12 2018
log(a(n)) ~ c * n^2, where c = -zeta'(2)/2 = A073002/2 = 0.468774... - Vaclav Kotesovec, Jun 24 2021
MATHEMATICA
Table[Product[Floor[n/k]!^k, {k, 1, n}], {n, 1, 15}] (* Vaclav Kotesovec, Jun 24 2021 *)
Table[Product[k^(Floor[n/k]*(1 + Floor[n/k])/2), {k, 1, n}], {n, 1, 15}] (* Vaclav Kotesovec, Jun 24 2021 *)
PROG
(PARI) a(n) = prod(k=1, n, k^((n\k) * (1 + n\k) \ 2)); \\ Daniel Suteu, Sep 12 2018
CROSSREFS
Sequence in context: A229052 A363838 A280117 * A092287 A035482 A322716
KEYWORD
nonn,easy
AUTHOR
Peter Bala, Apr 11 2007
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 May 5 19:28 EDT 2024. Contains 372277 sequences. (Running on oeis4.)