The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A129364 a(n) = Product_{k = 1..n} A066841(k). 2
 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 PROG (PARI) a(n) = prod(k=1, n, k^((n\k) * (1 + n\k) \ 2)); \\ Daniel Suteu, Sep 12 2018 CROSSREFS Cf. A007955, A066841, A092143, A092287, A129365. Sequence in context: A206156 A229052 A280117 * A092287 A035482 A322716 Adjacent sequences:  A129361 A129362 A129363 * A129365 A129366 A129367 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 1 22:24 EST 2020. Contains 338858 sequences. (Running on oeis4.)