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.

Showing 1-1 of 1 results.

A304823 Convolution of number of partitions into distinct parts and central binomial coefficients.

Original entry on oeis.org

1, 3, 9, 30, 102, 361, 1308, 4819, 17970, 67614, 256156, 975742, 3733255, 14336290, 55224880, 213298817, 825741010, 3203142338, 12447523904, 48448301960, 188838707898, 736985826174, 2879588370517, 11263139964066, 44096779183060, 172797721166402
Offset: 0

Views

Author

Vaclav Kotesovec, May 19 2018

Keywords

Crossrefs

Programs

  • Mathematica
    Table[Sum[PartitionsQ[n-k]*Binomial[2*k, k], {k, 0, n}], {n, 0, 25}]

Formula

a(n) ~ QPochhammer[-1, 1/4] * 2^(2*n-1) / sqrt(Pi*n).
Showing 1-1 of 1 results.