Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A114586
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A114586 Triangle read by rows: T(n,k) is the number of hill-free Dyck paths of semilength n and having k peaks at odd levels (0<=k<=n-2; n>=2). A hill in a Dyck path is a peak at level 1. +0
3
1, 1, 1, 3, 2, 1, 6, 8, 3, 1, 15, 22, 15, 4, 1, 36, 68, 52, 24, 5, 1, 91, 198, 191, 100, 35, 6, 1, 232, 586, 651, 425, 170, 48, 7, 1, 603, 1718, 2203, 1656, 820, 266, 63, 8, 1, 1585, 5047, 7285, 6299, 3591, 1435, 392, 80, 9, 1, 4213, 14808, 23832, 23164, 15155, 6972, 2338 (list; table; graph; listen)
page 1

Search completed in 0.001 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 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research