Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A108767
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A108767 Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(1,1), d=(1,-2) and have k peaks (i.e. ud's). +0
4
1, 1, 2, 1, 6, 5, 1, 12, 28, 14, 1, 20, 90, 120, 42, 1, 30, 220, 550, 495, 132, 1, 42, 455, 1820, 3003, 2002, 429, 1, 56, 840, 4900, 12740, 15288, 8008, 1430, 1, 72, 1428, 11424, 42840, 79968, 74256, 31824, 4862, 1, 90, 2280, 23940, 122094, 325584, 465120 (list; table; 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 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research