Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A114503
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A114503 Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n for which height of first peak + height of last peak = k (n>=1; 2<=k<=2n). +0
1
1, 1, 0, 1, 1, 2, 1, 0, 1, 2, 4, 4, 2, 1, 0, 1, 5, 10, 11, 8, 4, 2, 1, 0, 1, 14, 28, 32, 26, 16, 8, 4, 2, 1, 0, 1, 42, 84, 98, 84, 57, 32, 16, 8, 4, 2, 1, 0, 1, 132, 264, 312, 276, 198, 120, 64, 32, 16, 8, 4, 2, 1, 0, 1, 429, 858, 1023, 924, 687, 438, 247, 128, 64, 32, 16, 8, 4, 2, 1, 0, 1 (list; graph; listen)
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 18 21:37 EST 2009. Contains 171024 sequences.


AT&T Labs Research