Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A096588
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A096588 a(n)=number of Catalan knight paths in Quadrant I from (0,0) to points on the vertical line x=n. A Catalan knight moves (2 right and 1 up) or (1 right and 1 down). +0
2
1, 1, 3, 6, 16, 38, 99, 248, 646, 1659, 4342, 11307, 29740, 78115, 206349, 545156, 1445332, 3834559, 10197168, 27140709, 72357778, 193076677, 515843630, 1379308111, 3691755414, 9888374480, 26507373732, 71103941488, 190859621124 (list; graph; listen)
OFFSET

0,3

FORMULA

Row sums of array in A096587.

EXAMPLE

Rows of array T(n,k) in A096587:

1

0 0 1

1 1 0 0 1

0 1 2 2 0 0 1

a(3)=T(3,0)+T(3,1)+...+T(3,6)=6.

CROSSREFS

Cf. A096587.

Sequence in context: A089406 A027852 A114410 this_sequence A073079 A143560 A001675

Adjacent sequences: A096585 A096586 A096587 this_sequence A096589 A096590 A096591

KEYWORD

nonn

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 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research