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.

A171368 Another version of A126216.

Original entry on oeis.org

1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 2, 0, 1, 0, 0, 0, 5, 0, 1, 0, 0, 5, 0, 9, 0, 1, 0, 0, 0, 21, 0, 14, 0, 1, 0, 0, 14, 0, 56, 0, 20, 0, 1, 0, 0, 0, 84, 0, 120, 0, 27, 0, 1, 0, 0, 42, 0, 300, 0, 225, 0, 35, 0, 1, 0, 0, 0, 330, 0, 825, 0, 385, 0, 44, 0, 1, 0, 0
Offset: 0

Views

Author

Philippe Deléham, Dec 06 2009

Keywords

Comments

Expansion of the first column of the triangle T_(0,x), T_(x,y) defined in A039599; T_(0,0)= A053121, T_(0,1)= A089942, T_(0,2)= A126093, T_(0,3)= A126970.
T(n,k) is the number of Riordan paths of length n with k horizontal steps. A Riordan path is a Motzkin path with no horizontal steps on the x-axis. - Emanuele Munarini, Oct 14 2023

Examples

			Triangle begins:
  1 ;
  0,0 ;
  1,0,0 ;
  0,1,0,0 ;
  2,0,1,0,0 ;
  0,5,0,1,0,0 ;
  5,0,9,0,1,0,0 ;
  ...
		

Crossrefs

Formula

Sum_{k, 0<=k<=n} T(n,k)*x^k = A099323(n+1), A126120(n), A005043(n), A000957(n+1), A117641(n) for x = -1, 0, 1, 2, 3 respectively.