Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A104544
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A104544 Triangle read by rows: T(n,k) is the number of Motzkin paths of length n having k HH's, where H=(1,0). +0
2
1, 1, 1, 3, 0, 1, 5, 3, 0, 1, 11, 6, 3, 0, 1, 25, 13, 9, 3, 0, 1, 55, 40, 16, 12, 3, 0, 1, 129, 95, 60, 20, 15, 3, 0, 1, 303, 250, 155, 80, 25, 18, 3, 0, 1, 721, 661, 415, 235, 100, 31, 21, 3, 0, 1, 1743, 1708, 1206, 620, 335, 120, 38, 24, 3, 0, 1, 4241, 4515, 3262, 1946, 875, 455 (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 1 19:22 EST 2009. Contains 167811 sequences.


AT&T Labs Research