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.

A167194 Triangle read by rows. A130713 in the columns.

Original entry on oeis.org

1, 2, 1, 1, 2, 1, 0, 1, 2, 1, 0, 0, 1, 2, 1, 0, 0, 0, 1, 2, 1, 0, 0, 0, 0, 1, 2, 1, 0, 0, 0, 0, 0, 1, 2, 1, 0, 0, 0, 0, 0, 0, 1, 2, 1, 0, 0, 0, 0, 0, 0, 0, 1, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 1
Offset: 1

Views

Author

Mats Granvik, Oct 30 2009

Keywords

Examples

			Table begins:
  1;
  2,1;
  1,2,1;
  0,1,2,1;
  0,0,1,2,1;
  0,0,0,1,2,1;
  0,0,0,0,1,2,1;
  0,0,0,0,0,1,2,1;
  0,0,0,0,0,0,1,2,1;
  0,0,0,0,0,0,0,1,2,1;
  0,0,0,0,0,0,0,0,1,2,1;
  ...
		

Crossrefs

Programs

  • Mathematica
    Array[PadLeft[{1, 2, 1}, #] &,15] (* Paolo Xausa, Jun 27 2024 *)

Formula

From Peter Bala, Sep 12 2012: (Start)
T(n,k) = binomial(2,n-k).
O.g.f.: (1+x)^2/(1-t*x).
Riordan array ((1+x)^2,x).
Matrix inverse is signed version of A004736. (End)