Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A114576
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A114576 Triangle read by rows: T(n,k) is number of Motzkin paths of length n having k UH's, where U=(1,1), H=(1,0) (0<=k<=floor(n/3). +0
1
1, 1, 2, 3, 1, 6, 3, 11, 10, 23, 26, 2, 47, 70, 10, 102, 176, 45, 221, 449, 160, 5, 493, 1121, 539, 35, 1105, 2817, 1680, 196, 2516, 7031, 5082, 868, 14, 5763, 17604, 14856, 3486, 126, 13328, 43996, 42660, 12810, 840, 30995, 110147, 120338, 44640, 4410, 42 (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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research