Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A096591
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A096591 Triangle T, read by rows, such that the matrix square shifts T one place diagonally left and upward, with T(n,0)=T(n,n)=1 for n>=0. +0
3
1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 2, 1, 1, 1, 5, 5, 2, 1, 1, 1, 8, 10, 5, 2, 1, 1, 1, 15, 22, 14, 5, 2, 1, 1, 1, 28, 47, 34, 14, 5, 2, 1, 1, 1, 61, 113, 88, 42, 14, 5, 2, 1, 1, 1, 133, 269, 223, 116, 42, 14, 5, 2, 1, 1, 1, 328, 705, 609, 333, 132, 42, 14, 5, 2, 1, 1, 1, 807, 1843, 1660 (list; table; graph; listen)
OFFSET

0,8

COMMENT

Column with index 1 forms the row sums shift right. The convergent of the rows in reverse order is the Catalan sequence (A000108).

FORMULA

T(n, k) = Sum_{i=0..n-1} T(n-2, i)*T(i, k-1) for n>1 and k>0; T(n, 0)=T(n, n)=1.

EXAMPLE

Rows begin:

[1],

[1,1],

[1,1,1],

[1,2,1,1],

[1,3,2,1,1],

[1,5,5,2,1,1],

[1,8,10,5,2,1,1],

[1,15,22,14,5,2,1,1],

[1,28,47,34,14,5,2,1,1],

[1,61,113,88,42,14,5,2,1,1],

[1,133,269,223,116,42,14,5,2,1,1],...

The matrix square of T is given by:

[1],

[2,1],

[3,2,1],

[5,5,2,1],

[8,10,5,2,1],

[15,22,14,5,2,1],

[28,47,34,14,5,2,1],

[61,113,88,42,14,5,2,1],

[133,269,223,116,42,14,5,2,1],...

which equals T shift one place diagonally left and upward.

PROGRAM

(PARI) T(n, k)=if(n<k|k<0, 0, if(n==k|k==0, 1, sum(i=0, n-1, T(n-2, i)*T(i, k-1)); ))

CROSSREFS

Cf. A096592, A000108.

Sequence in context: A119269 A129713 A096669 this_sequence A115568 A072909 A095691

Adjacent sequences: A096588 A096589 A096590 this_sequence A096592 A096593 A096594

KEYWORD

nonn,tabl

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Jun 28 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research