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.

A039910 Lower triangular matrix T = Pascal lower triangular matrix divided on the left by its entry-square.

Original entry on oeis.org

1, 0, 1, 0, -2, 1, 0, 12, -6, 1, 0, -132, 66, -12, 1, 0, 2280, -1140, 210, -20, 1, 0, -56760, 28380, -5240, 510, -30, 1, 0, 1923600, -961800, 177660, -17360, 1050, -42, 1, 0, -85149960, 42574980, -7864920, 769090, -46760, 1932, -56, 1
Offset: 0

Views

Author

Keywords

Comments

Reference is a solution to a problem of I. Gessel.

Examples

			1;
0,1;
0,-2,1;
0,12,-6,1;
0,-132,66,-12,1;
etc.
		

References

  • "Inverse of a Combinatorial Matrix", Dave Callan, American Mathematical Monthly, Vol. 95 (1988), pp. 770-771.

Crossrefs

Formula

T=Inverse matrix of {a_ij}:{binomial(i, j)*binomial(j, j-i)}=[ A008459 ]^(-1)*[ A007318 ]