Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A108425
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A108425 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=(2,1),U=(1,2), or d=(1,-1) and have k peaks (i.e. ud and Ud's). +0
4
2, 4, 6, 8, 36, 22, 16, 144, 248, 90, 32, 480, 1600, 1560, 394, 64, 1440, 7840, 14400, 9420, 1806, 128, 4032, 32480, 95760, 115416, 55692, 8558, 256, 10752, 120064, 517440, 986272, 860832, 325360, 41586, 512, 27648, 408576, 2419200, 6668928 (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 December 15 00:42 EST 2009. Contains 170824 sequences.


AT&T Labs Research