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.

A099557 Slanted Pascal's triangle, read by rows, such that T(n,k) = binomial(n-[k/2],k) for [n*2/3]>=k>=0, where [x]=floor(x).

Original entry on oeis.org

1, 1, 1, 1, 2, 0, 1, 3, 1, 0, 1, 4, 3, 1, 0, 1, 5, 6, 4, 0, 0, 1, 6, 10, 10, 1, 0, 0, 1, 7, 15, 20, 5, 1, 0, 0, 1, 8, 21, 35, 15, 6, 0, 0, 0, 1, 9, 28, 56, 35, 21, 1, 0, 0, 0, 1, 10, 36, 84, 70, 56, 7, 1, 0, 0, 0, 1, 11, 45, 120, 126, 126, 28, 8, 0, 0, 0, 0
Offset: 0

Views

Author

Paul D. Hanna, Oct 22 2004

Keywords

Comments

Row sums form A005314. Antidiagonal sums form A099558.

Examples

			Rows begin:
[1],
[1,1],
[1,2,0],
[1,3,1,0],
[1,4,3,1,0],
[1,5,6,4,0,0],
[1,6,10,10,1,0,0],
[1,7,15,20,5,1,0,0],
[1,8,21,35,15,6,0,0,0],
[1,9,28,56,35,21,1,0,0,0],
[1,10,36,84,70,56,7,1,0,0,0],...
and can be derived from Pascal's triangle
by shifting each column k down by [k/2] rows.
		

Crossrefs

Programs

  • PARI
    {T(n,k)=polcoeff(polcoeff((1-x+x*y)/((1-x)^2-x^3*y^2)+x*O(x^n),n,x)+y*O(y^k),k,y)}

Formula

G.f.: (1-x+x*y)/((1-x)^2-x^3*y^2).