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.

A050174 T(n,k) = S(n,k,k-2), 1<=k<=n-2, n >= 3, array S as in A050157.

Original entry on oeis.org

1, 2, 2, 3, 5, 5, 4, 9, 14, 9, 5, 14, 28, 28, 14, 6, 20, 48, 62, 48, 20, 7, 27, 75, 117, 117, 75, 27, 8, 35, 110, 200, 242, 200, 110, 35, 9, 44, 154, 319, 451, 451, 319, 154, 44, 10, 54, 208, 483, 780, 912, 780, 483, 208, 54, 11, 65, 273, 702, 1274
Offset: 3

Views

Author

Keywords

Comments

S(n,k,k) = C(n,k) for 1<=k<=n, n >= 1; cf. Pascal's triangle, A007318.
S(n,k,k-1), 1<=k<=n-1, n >= 2 is given by A014430.

Examples

			Rows:
1;
2, 2;
3, 5, 5;
4, 9, 14, 9;
5, 14, 28, 28, 14;
...
		

Crossrefs

Formula

T(n,k) = C(n,k) - n for k>1, and T(n, 1) = n - 2. - Andrei Asinowski, Jan 27 2016

Extensions

Offset changed to 3 by Michel Marcus, Jan 29 2016