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.

A001404 Triangle of values of 2-d recurrence.

Original entry on oeis.org

1, 1, 1, 2, 2, 1, 4, 5, 2, 1, 9, 11, 5, 2, 1, 20, 25, 12, 5, 2, 1, 45, 57, 27, 12, 5, 2, 1, 102, 129, 62, 28, 12, 5, 2, 1, 231, 293, 141, 64, 28, 12, 5, 2, 1, 524, 665, 321, 146, 65, 28, 12, 5, 2, 1, 1189, 1510, 729, 333, 148, 65, 28, 12, 5, 2, 1, 2699, 3428, 1656
Offset: 0

Views

Author

N. J. A. Sloane [ I have temporarily mislaid the name of the person who sent this ]

Keywords

Comments

The first column of the triangle (see example) appears to be A167750. [Joerg Arndt, Jul 09 2012]

Examples

			Triangle starts
1,
1, 1,
2, 2, 1,
4, 5, 2, 1,
9, 11, 5, 2, 1,
20, 25, 12, 5, 2, 1,
45, 57, 27, 12, 5, 2, 1,
102, 129, 62, 28, 12, 5, 2, 1,
231, 293, 141, 64, 28, 12, 5, 2, 1,
524, 665, 321, 146, 65, 28, 12, 5, 2, 1,
1189, 1510, 729, 333, 148, 65, 28, 12, 5, 2, 1,
		

Crossrefs

Cf. A001410.

Programs

  • Maple
    a[ 0,0 ] := 1; for i from 1 to N do a[ i,0 ] := a[ i-1,0 ]+a[ i-1,1 ]; for j from 1 to i do a[ i,j ] := sum(a[ i-j,t ],t=0..min(j+1,N)) od; od;
  • PARI
    T(m,n)=if(mRalf Stephan */

Extensions

Sequence corrected by Sean A. Irvine, Jul 08 2012