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.

A213600 Triangle T(n,k) read by rows: Number of Dyck n-paths with midpoint at height k.

Original entry on oeis.org

1, 0, 1, 1, 0, 1, 0, 4, 0, 1, 4, 0, 9, 0, 1, 0, 25, 0, 16, 0, 1, 25, 0, 81, 0, 25, 0, 1, 0, 196, 0, 196, 0, 36, 0, 1, 196, 0, 784, 0, 400, 0, 49, 0, 1, 0, 1764, 0, 2304, 0, 729, 0, 64, 0, 1, 1764, 0, 8100, 0, 5625, 0, 1225, 0, 81, 0, 1, 0, 17424, 0, 27225, 0, 12100, 0
Offset: 0

Views

Author

David Scambler, Jun 14 2012

Keywords

Examples

			Triangle T(n,k) begins:
     1
     0    1
     1    0    1
     0    4    0    1
     4    0    9    0    1
     0   25    0   16    0   1
    25    0   81    0   25   0    1
     0  196    0  196    0  36    0  1
   196    0  784    0  400   0   49  0  1
     0 1764    0 2304    0 729    0 64  0  1
  1764    0 8100    0 5625   0 1225  0 81  0  1
  ...
		

Crossrefs

Row sums give A000108.
T(2n,0) gives A001246.
T(2n,2) gives A338727(n) for n>=1.
Cf. A053121.

Formula

T(n,k) = A053121(n,k)^2.
Showing 1-1 of 1 results.