login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A342967
a(n) = 1 + Sum_{j=1..n} Product_{k=0..j-1} binomial(2*n-1,n+k) / binomial(2*n-1,k).
2
1, 2, 5, 22, 177, 2606, 70226, 3457742, 311348897, 51177188350, 15377065068510, 8430169458379450, 8446194335222422950, 15435904380166258833482, 51546769958534244310727102, 313937270864810066000897492222, 3493348088919874482660174997662017
OFFSET
0,2
LINKS
FORMULA
a(n) = Sum_{j=0..n} Product_{k=0..n-1} binomial(n+k,j)/binomial(j+k,j).
a(n) ~ c * exp(1/12) * 2^(4*n^2 - 1/12) / (A * n^(1/12) * 3^(9*n^2/4 - 1/6)), where c = JacobiTheta3(0,1/3) = EllipticTheta[3, 0, 1/3] = 1.69145968168171534134842... if n is even, and c = JacobiTheta2(0,1/3) = EllipticTheta[2, 0, 1/3] = 1.69061120307521423305296... if n is odd, and A is the Glaisher-Kinkelin constant A074962. - Vaclav Kotesovec, Apr 02 2021
MATHEMATICA
a[n_] := 1 + Sum[Product[Binomial[2*n - 1, n + k]/Binomial[2*n - 1, k], {k, 0, j - 1}], {j, 1, n}]; Array[a, 17, 0] (* Amiram Eldar, Apr 01 2021 *)
Table[1 + BarnesG[2*n + 1] * Sum[BarnesG[j + 1]*BarnesG[n - j + 1] / (BarnesG[n + j + 1]*BarnesG[2*n - j + 1]), {j, 1, n}], {n, 0, 15}] (* Vaclav Kotesovec, Apr 02 2021 *)
PROG
(PARI) a(n) = 1+sum(j=1, n, prod(k=0, j-1, binomial(2*n-1, n+k)/binomial(2*n-1, k)));
(PARI) a(n) = sum(j=0, n, prod(k=0, n-1, binomial(n+k, j)/binomial(j+k, j)));
CROSSREFS
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Apr 01 2021
STATUS
approved