Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A096587
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A096587 Triangle read by rows: T(n,k)=number of Catalan knight paths in Quadrant I from (0,0) to (n,k). A Catalan knight moves (1 right and 2 up) or (1 right and 2 down) or (2 right and 1 up) or (2 right and 1 down). +0
7
1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 2, 2, 0, 0, 1, 3, 3, 1, 2, 3, 3, 0, 0, 1, 2, 4, 9, 8, 3, 3, 4, 4, 0, 0, 1, 12, 12, 10, 11, 18, 15, 6, 4, 5, 5, 0, 0, 1, 14, 22, 42, 39, 27, 22, 30, 24, 10, 5, 6, 6, 0, 0, 1, 54, 61, 64, 72, 98, 87, 56, 38, 45, 35, 15, 6, 7, 7, 0, 0, 1, 86, 128, 213, 217, 181, 167 (list; table; graph; listen)
OFFSET

1,12

COMMENT

A005220=Column 1; A005201=Column 2.

FORMULA

T(0, 0)=1; T(1, 2)=1; for n>=2, T(n, 0)=T(n-2, 1)+T(n-1, 2), T(n, 1)=T(n-2, 0)+T(n-2, 2)+T(n-1, 3); for k>=2, T(n, k)=T(n-2, k-1)+T(n-2, k+1)+T(n-1, k-2)+T(n-1, k+2).

EXAMPLE

Rows:

1

0 0 1

1 1 0 0 1

0 1 2 2 0 0 1

T(3,2) counts these paths: (0,0)-(1,2)-(2,0)-(3,2)

and (0,0)-(1,2)-(2,4)-(3,2).

CROSSREFS

Cf. A005220, A005201, A096588.

Sequence in context: A103822 A029392 A035379 this_sequence A136438 A059848 A036865

Adjacent sequences: A096584 A096585 A096586 this_sequence A096588 A096589 A096590

KEYWORD

nonn,tabl

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu), 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 December 4 08:07 EST 2009. Contains 170310 sequences.


AT&T Labs Research