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.

A177993 Triangle read by rows, A177990 * A007318.

Original entry on oeis.org

1, 1, 1, 2, 3, 1, 2, 4, 3, 1, 3, 8, 9, 5, 1, 3, 9, 13, 11, 5, 1, 4, 15, 28, 31, 20, 7, 1, 4, 16, 34, 46, 40, 22, 7, 1, 5, 24, 62, 102, 110, 78, 35, 9, 1, 5, 25, 70, 130, 166, 148, 91, 37, 9, 1, 6, 35, 115, 250, 376, 400, 301, 157, 54, 11, 1, 6, 36, 125, 295, 496, 610, 553, 367, 174, 56, 11, 1
Offset: 0

Views

Author

Gary W. Adamson, May 16 2010

Keywords

Examples

			First few rows of the triangle =
1;
1, 1;
2, 3, 1;
2, 4, 3, 1;
3, 8, 9, 5, 1;
3, 9, 13, 11, 5, 1;
4, 15, 28, 31, 20, 7, 1;
4, 16, 34, 46, 40, 22, 7, 1;
5, 24, 62, 102, 110, 78, 35, 9, 1;
5, 25, 70, 130, 166, 148, 91, 37, 9, 1;
6, 35, 115, 250, 376, 400, 301, 157, 54, 11, 1;
6, 36, 125, 295, 496, 610, 553, 367, 174, 56, 11, 1;
7, 48, 191, 515, 991, 1402, 1477, 1159, 669, 276, 77, 13, 1;
7, 49, 203, 581, 1211, 1897, 2269, 2083, 1461, 771, 297, 709, 13, 1;
...
		

Crossrefs

Row sums are A061547(n+1).
Cf. A061547.

Programs

  • PARI
    T(n,k) = {binomial(n,k) + sum(j=0, n\2-1, binomial(2*j+1,k))} \\ Andrew Howroyd, Apr 13 2021

Formula

As infinite lower triangular matrices, A177990 * Pascal's triangle, (A007318).
T(n,k) = binomial(n,k) + Sum_{j=0..floor(n/2)-1} binomial(2*j+1,k). - Andrew Howroyd, Apr 13 2021

Extensions

Terms a(55) and beyond from Andrew Howroyd, Apr 13 2021