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.

A130671 Triangular sequence based on Pascal's triangle: t(n,m) = 2*binomial(m, n) - (1 + n*(m - n)).

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 4, 7, 4, 1, 1, 5, 13, 13, 5, 1, 1, 6, 21, 30, 21, 6, 1, 1, 7, 31, 57, 57, 31, 7, 1, 1, 8, 43, 96, 123, 96, 43, 8, 1, 1, 9, 57, 149, 231, 231, 149, 57, 9, 1, 1, 10, 73, 218, 395, 478, 395, 218, 73, 10, 1
Offset: 1

Views

Author

Roger L. Bagula and Gary W. Adamson, Jun 27 2007

Keywords

Comments

Suggested by Gary W. Adamson from a previous submission. Very close to (but slightly smaller at 7th row) A086617.

Examples

			{1},
{1, 1},
{1, 2, 1},
{1, 3, 3, 1},
{1, 4, 7, 4, 1},
{1, 5, 13, 13, 5, 1},
{1, 6, 21, 30, 21, 6, 1},
{1, 7, 31, 57, 57, 31, 7, 1}
		

Crossrefs

Cf. A086617.

Programs

  • Mathematica
    Table[Table[2*Binomial[m, n] - (1 + n*(m - n)), {n, 0, m}], {m, 0, 10}] Flatten[%]

Formula

t(n,m) = 2*binomial[m, n] - (1 + n*(m - n)).