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.

Showing 1-1 of 1 results.

A174035 A triangle sequence of the form: T(n,m) = binomial(n, m) + floor(Eulerian(n + 1, m)/2).

Original entry on oeis.org

1, 1, 1, 1, 4, 1, 1, 8, 8, 1, 1, 17, 39, 17, 1, 1, 33, 161, 161, 33, 1, 1, 66, 610, 1228, 610, 66, 1, 1, 130, 2167, 7844, 7844, 2167, 130, 1, 1, 259, 7332, 44173, 78165, 44173, 7332, 259, 1, 1, 515, 23956, 227680, 655303, 655303, 227680, 23956, 515, 1, 1, 1028, 76363, 1101864, 4869267, 7862376, 4869267, 1101864, 76363, 1028, 1
Offset: 0

Views

Author

Roger L. Bagula, Mar 06 2010

Keywords

Comments

Row sums are: {1, 2, 6, 18, 75, 390, 2582, 20284, 181695, 1814910, 19959422,...}.

Examples

			Triangle begins:
  {1},
  {1, 1},
  {1, 4, 1},
  {1, 8, 8, 1},
  {1, 17, 39, 17, 1},
  {1, 33, 161, 161, 33, 1},
  {1, 66, 610, 1228, 610, 66, 1},
  {1, 130, 2167, 7844, 7844, 2167, 130, 1},
  {1, 259, 7332, 44173, 78165, 44173, 7332, 259, 1},
  {1, 515, 23956, 227680, 655303, 655303, 227680, 23956, 515, 1},
  {1, 1028, 76363, 1101864, 4869267, 7862376, 4869267, 1101864, 76363, 1028, 1}
		

Crossrefs

Programs

  • Mathematica
    << DiscreteMath`Combinatorica`
    Table[Table[Binomial[n, m] + Floor[Eulerian[n + 1, m] 2], {m, 0, n}], {n, 0, 10}];
    Flatten[%]

Formula

T(n,m) = binomial(n, m) + floor(Eulerian(n + 1, m)/2).
T(n,m) = A007318(n, m) + floor(A008292(n + 1, m + 1)/2). - Jason Yuen, May 10 2025
Showing 1-1 of 1 results.