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.

A247645 Triangle read by rows: T(j,0)=1, T(0,j) = [j=0], T(-1,j)=T(-2,j)=0, T(j,k)=2T(j-1,k)-T(j-2,k)+T(j-1,k-2)+T(j-2,k-2).

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 4, 1, 1, 1, 3, 9, 5, 7, 1, 1, 1, 4, 16, 14, 26, 8, 10, 1, 1, 1, 5, 25, 30, 70, 34, 52, 11, 13, 1, 1, 1, 6, 36, 55, 155, 104, 190, 63, 87, 14, 16, 1, 1, 1, 7, 49, 91, 301, 259, 553, 253, 403, 101, 131, 17, 19, 1, 1, 1, 8, 64, 140, 532, 560
Offset: 0

Views

Author

N. J. A. Sloane, Sep 23 2014

Keywords

Examples

			Triangle begins:
1,
1,1,1,
1,2,4,1,1,
1,3,9,5,7,1,1,
1,4,16,14,26,8,10,1,1,
1,5,25,30,70,34,52,11,13,1,1,
1,6,36,55,155,104,190,63,87,14,16,1,1
1,7,49,91,301,259,553,253,403,101,131,17,19,1,1
1,8,64,140,532,560,1372,806,1462,504,736,148,184,20,22,1,1
...
		

Crossrefs

Programs

  • Mathematica
    T[, 0] = 1; T[j, k_] /; 0 <= k <= 2j := T[j, k] = Which[k<0 || k>2j, 0, k == 2j || k == 2j-1, 1, OddQ[k], T[j-1, k] + T[j-1, k-1], EvenQ[k], T[j-1, k-2] + 2 T[j-1, k-1] + T[j-1, k]];
    Table[T[j, k], {j, 0, 8}, {k, 0, 2j}] // Flatten (* Jean-François Alcover, Oct 09 2018 *)

Extensions

More terms from Lars Blomberg, Aug 05 2015