cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A296590 a(n) = Product_{k=0..n} binomial(2*n - k, k).

Original entry on oeis.org

1, 1, 3, 30, 1050, 132300, 61122600, 104886381600, 674943865596000, 16407885372638760000, 1515727634953623371280000, 534621388490302221024396480000, 722849817707190846398223943885440000, 3759035907022704558524683975387453632000000
Offset: 0

Views

Author

Vaclav Kotesovec, Dec 16 2017

Keywords

Comments

Apart from the offset the same as A203469. - R. J. Mathar, Alois P. Heinz, Jan 02 2018

Crossrefs

Programs

  • Maple
    A296590 := proc(n)
        mul( binomial(2*n-k,k),k=0..n) ;
    end proc:
    seq(A296590(n),n=0..7) ; # R. J. Mathar, Jan 03 2018
  • Mathematica
    Table[Product[Binomial[2*n-k, k], {k, 0, n}], {n, 0, 15}]
    Table[Glaisher^(3/2) * 2^(n^2 - 1/24) * BarnesG[n + 3/2] / (E^(1/8) * Pi^(n/2 + 1/4) * BarnesG[n + 2]), {n, 0, 15}]

Formula

a(n) = A^(3/2) * 2^(n^2 - 1/24) * BarnesG(n + 3/2) / (exp(1/8) * Pi^(n/2 + 1/4) * BarnesG(n + 2)), where A is the Glaisher-Kinkelin constant A074962.
a(n) ~ A^(3/2) * exp(n/2 - 1/8) * 2^(n^2 - 7/24) / (Pi^((n+1)/2) * n^(n/2 + 3/8)), where A is the Glaisher-Kinkelin constant A074962.
Product_{1 <= j <= i <= n} (i + j - 1)/(i - j + 1). - Peter Bala, Oct 25 2024