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.

A144463 Triangle T(n,m) read by rows: T(n,m)= A013609(n,m) if m <= n/2, T(n,m)= T(n,n-m) otherwise.

Original entry on oeis.org

1, 1, 1, 1, 4, 1, 1, 6, 6, 1, 1, 8, 24, 8, 1, 1, 10, 40, 40, 10, 1, 1, 12, 60, 160, 60, 12, 1, 1, 14, 84, 280, 280, 84, 14, 1, 1, 16, 112, 448, 1120, 448, 112, 16, 1, 1, 18, 144, 672, 2016, 2016, 672, 144, 18, 1, 1, 20, 180, 960, 3360, 8064, 3360, 960, 180, 20, 1
Offset: 0

Views

Author

Roger L. Bagula and Gary W. Adamson, Oct 09 2008

Keywords

Comments

Row sums are 1, 2, 6, 14, 42, 102, 306, 758, 2274, 5702, 17106,...

Examples

			T(n,m) = 2^m*binomial(n,m) if 0 <= m <= n/2, T(n,m)= 2^(n-m)*binomial(n,m) if n/2 <= m <= n.
1;
1, 1;
1, 4, 1;
1, 6, 6, 1;
1, 8, 24, 8, 1;
1, 10, 40, 40, 10, 1;
1, 12, 60, 160, 60, 12, 1;
1, 14, 84, 280, 280, 84, 14, 1;
1, 16, 112, 448, 1120, 448, 112, 16, 1;
1, 18, 144, 672, 2016, 2016, 672, 144, 18, 1;
1, 20, 180, 960, 3360, 8064, 3360, 960, 180, 20, 1;
		

Programs

  • Mathematica
    Clear[f, t]; f[n_, m_] = If[m <= Floor[n/2], m, n - m]; t[n_, m_] = Binomial[n, m]*2^f[n, m]; Table[Table[t[n, m], {m, 0, n}], {n, 0, 10}]; Flatten[%]

Extensions

Offset corrected, keyword:tabl inserted by the Assoc. Eds. of the OEIS, Jun 30 2010