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.

A198295 Riordan array (1, x*(1+x)/(1-x^3)).

Original entry on oeis.org

1, 0, 1, 0, 1, 1, 0, 0, 2, 1, 0, 1, 1, 3, 1, 0, 1, 2, 3, 4, 1, 0, 0, 4, 4, 6, 5, 1, 0, 1, 2, 9, 8, 10, 6, 1, 0, 1, 3, 9, 17, 15, 15, 7, 1, 0, 0, 6, 9, 24, 30, 26, 21, 8, 1, 0, 1, 3, 18, 26, 51, 51, 42, 28, 9, 1
Offset: 0

Views

Author

Philippe Deléham, Jan 26 2012

Keywords

Comments

Triangle T(n,k), read by rows, given by (0, 1, -1, -1, 2, -1, 0, 0, 0, 0, 0, 0, 0, ...) DELTA (1, 0, 0, 0, 0, 0, 0, 0, ...) where DELTA is the operator defined in A084938.
Antidiagonals sums: see A159284.

Examples

			Triangle begins:
1
0, 1
0, 1, 1
0, 0, 2, 1
0, 1, 1, 3, 1
0, 1, 2, 3, 4, 1
0, 0, 4, 4, 6, 5, 1
0, 1, 2, 9, 8, 10, 6, 1
0, 1, 3, 9, 17, 15, 15, 7, 1
		

References

  • A. Luzón, D. Merlini, M. A. Morón, R. Sprugnoli, Complementary Riordan arrays, Discrete Applied Mathematics, 172 (2014) 75-87.

Crossrefs

Cf. Diagonals: A000012, A001477, A161680, A000125.

Formula

Sum_{k, 0<=k<=n} T(n,k) = A001590(n+2), n>0.
Sum_{k, 0<=k<=n}T(n,k)*(-1)^(n-k) = A078056(n-1), n>0.
T(n,n) = A000012(n), T(n+1,n) = A001477(n) = n, T(n+2,n) = A161680(n) = A000217(n-1); T(n+3,n) = A000125(n-1), n>=1.
G.f.: (-1+x)*(1+x+x^2)/(-1+x^3+x*y+x^2*y). - R. J. Mathar, Aug 11 2015