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.

A128545 Triangle, read by rows, where T(n,k) is the coefficient of q^(n*k) in the q-binomial coefficient [2*n, n] for n >= k >= 0.

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 5, 8, 5, 1, 1, 7, 18, 18, 7, 1, 1, 11, 39, 58, 39, 11, 1, 1, 15, 75, 155, 155, 75, 15, 1, 1, 22, 141, 383, 526, 383, 141, 22, 1, 1, 30, 251, 867, 1555, 1555, 867, 251, 30, 1, 1, 42, 433, 1860, 4192, 5448, 4192, 1860, 433, 42, 1
Offset: 0

Views

Author

Paul D. Hanna, Mar 10 2007

Keywords

Comments

Variant of A047812 (Parker's partition triangle).
Column 1 equals the number of partitions of n: A000041(n) is the coefficient of q^n in the central q-binomial coefficient [2*n, n] for n > 0.

Examples

			Triangle T(n,k) (with rows n >= 0 and columns k = 0..n) begins:
  1;
  1,  1;
  1,  2,   1;
  1,  3,   3,    1;
  1,  5,   8,    5,    1;
  1,  7,  18,   18,    7,    1;
  1, 11,  39,   58,   39,   11,    1;
  1, 15,  75,  155,  155,   75,   15,    1;
  1, 22, 141,  383,  526,  383,  141,   22,   1;
  1, 30, 251,  867, 1555, 1555,  867,  251,  30,  1;
  1, 42, 433, 1860, 4192, 5448, 4192, 1860, 433, 42, 1;
  ...
		

Crossrefs

Cf. A003239, A047812 (variant), A047996, A123610, A123611 (row sums).
Cf. A000041 (column 1), A128552 (column 2), A128553 (column 3), A128554 (column 4).

Programs

  • PARI
    T(n,k)=if(n
    				

Formula

Row sums equal the row sums of triangle A123610: A123611(n) = 2*A047996(2*n,n) = 2*A003239(n) for n > 0, where A047996 is the triangle of circular binomial coefficients and A003239(n) = number of rooted planar trees with n non-root nodes.