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.

A085476 Periodic Pascal array, read by upward antidiagonals.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 1, 1, 4, 3, 1, 1, 1, 1, 5, 6, 1, 2, 1, 1, 1, 6, 10, 4, 1, 1, 1, 1, 1, 7, 15, 10, 1, 3, 1, 1, 1, 1, 8, 21, 20, 5, 1, 3, 2, 1, 1, 1, 9, 28, 35, 15, 1, 4, 1, 1, 1, 1, 1, 10, 36, 56, 35, 6, 1, 6, 1, 1, 1, 1
Offset: 0

Views

Author

Paul Barry, Jul 02 2003

Keywords

Comments

G.f. of binomial transform of n-th row is given by 1/((1-x)^(n+1)-x^(n+1)).

Examples

			Rows begin:
n\k | 0 1 2 3 4 5
----+------------
  0 | 1 1 1 1 1 1 ...
  1 | 1 1 1 1 1 1 ...
  2 | 1 2 1 1 2 1 ...
  3 | 1 3 3 1 1 3 ...
  4 | 1 4 6 4 1 1 ...
		

Crossrefs

Programs

Formula

Square array T(n, k) = C(n, k mod (n+1)).