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.

A156141 Triangle T(n,k) = A008517(n,k+1)+A008517(n,n+1-k) read by rows.

Original entry on oeis.org

2, 1, 1, 1, 4, 1, 1, 14, 14, 1, 1, 46, 116, 46, 1, 1, 172, 772, 772, 172, 1, 1, 834, 5160, 8800, 5160, 834, 1, 1, 5280, 39594, 90260, 90260, 39594, 5280, 1, 1, 40814, 361086, 981104, 1288040, 981104, 361086, 40814, 1, 1, 363884, 3801180, 12088796
Offset: 0

Views

Author

Roger L. Bagula, Feb 04 2009

Keywords

Comments

Row sums are 2*A001147(n).

Examples

			{2},
{1, 1},
{1, 4, 1},
{1, 14, 14, 1},
{1, 46, 116, 46, 1},
{1, 172, 772, 772, 172, 1},
{1, 834, 5160, 8800, 5160, 834, 1},
{1, 5280, 39594, 90260, 90260, 39594, 5280, 1},
{1, 40814, 361086, 981104, 1288040, 981104, 361086, 40814, 1},
{1, 363884, 3801180, 12088796, 18205564, 18205564, 12088796, 3801180, 363884, 1},
{1, 3630826, 44557888, 167513072, 283669904, 310714768, 283669904, 167513072, 44557888, 3630826, 1}
		

Crossrefs

Programs

  • Mathematica
    e[n_, 0] := 1;
    e[n_, k_] := 0 /; k >= n;
    e[n_, k_] := (k + 1)e[n - 1, k] + (2n - k - 1)e[n - 1, k - 1];
    Table[Table[e[n, k] + e[n, n - k], {k, 0, n}], {n, 0, 10}];
    Flatten[%]

Formula

T(n,0)=T(n,n) =1, n>=1.
T(n,k)= A008517(n,k+1)+A008517(n,n+1-k), n>1, 0
T(n,k)= T(n,n-k) .

Extensions

Definition simplified by the Associate Editors of the OEIS Sep 17 2009