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.

A119836 Bi-diagonal inverse of [k<=n]*n!/(2k)!.

Original entry on oeis.org

1, -2, 2, 0, -24, 12, 0, 0, -360, 120, 0, 0, 0, -6720, 1680, 0, 0, 0, 0, -151200, 30240, 0, 0, 0, 0, 0, -3991680, 665280, 0, 0, 0, 0, 0, 0, -121080960, 17297280, 0, 0, 0, 0, 0, 0, 0, -4151347200, 518918400, 0, 0, 0, 0, 0, 0, 0, 0, -158789030400, 17643225600, 0, 0, 0, 0, 0, 0, 0, 0, 0, -6704425728000, 670442572800
Offset: 0

Views

Author

Paul Barry, May 25 2006

Keywords

Comments

Row sums are A119837. T(n,n)=A001813(n). T(n,n-1)=2*A001814(n)

Examples

			Triangle begins
1,
-2, 2,
0, -24, 12,
0, 0, -360, 120,
0, 0, 0, -6720, 1680,
0, 0, 0, 0, -151200, 30240,
0, 0, 0, 0, 0, -3991680, 665280,
0, 0, 0, 0, 0, 0, -121080960, 17297280,
0, 0, 0, 0, 0, 0, 0, -4151347200, 518918400,
0, 0, 0, 0, 0, 0, 0, 0, -158789030400, 17643225600,
0, 0, 0, 0, 0, 0, 0, 0, 0, -6704425728000, 670442572800
		

Formula

Triangle T(n,n)=(2n)!/n!,T(n,n-1)=(2n)!/(n-1)!,T(n,k)=0 otherwise.
Showing 1-1 of 1 results.