OFFSET
0,2
REFERENCES
H. W. Gould, A class of binomial sums and a series transform, Utilitas Math., 45 (1994), 71-83.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
G. C. Greubel, Table of n, a(n) for n = 0..50
H. W. Gould, A class of binomial sums and a series transform, Utilitas Math., 45 (1994), 71-83. (Annotated scanned copy)
Bernd C. Kellner, Asymptotic products of binomial and multinomial coefficients revisited, Integers 24 (2024), Article #A59, 10 pp.; arXiv:2312.11369 [math.CO], 2023.
FORMULA
a(0) = 1, a(n) = (2^(2*n)*a(n - 1)*Gamma(n + 1/2))/(sqrt(Pi)*Gamma(n + 1)). - Ilya Gutkovskiy, Sep 18 2015
a(n) = (2^(n^2 + n - 1/24)*A^(3/2)*Pi^(-n/2 - 1/4)*BarnesG(n + 3/2))/(e^(1/8)*BarnesG(n + 2)), where A is the Glaisher-Kinkelin constant (A074962), BarnesG is the Barnes G-function. - Ilya Gutkovskiy, Sep 18 2015
a(n) ~ A^(3/2) * 2^(n^2 + n - 7/24) * exp(n/2 - 1/8) / (Pi^((n+1)/2) * n^(n/2 + 3/8)), where A = A074962 is the Glaisher-Kinkelin constant. - Vaclav Kotesovec, Apr 16 2016
For n>0, a(n) = 2^((n+1)/2) * sqrt(BarnesG(2*n)) * Gamma(2*n) / (n * BarnesG(n)^2 * Gamma(n)^(7/2)). - Vaclav Kotesovec, Apr 20 2024
MAPLE
[seq(mul(binomial(2*k, k), k=1..n), n=0..16)];
MATHEMATICA
Table[Product[Binomial[2*k, k], {k, 1, n}], {n, 0, 50}] (* G. C. Greubel, Feb 02 2017 *)
PROG
(PARI) a(n) = prod(k=1, n, binomial(2*k, k)); \\ Michel Marcus, Sep 18 2015
CROSSREFS
KEYWORD
nonn
AUTHOR
STATUS
approved