Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A132276
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A132276 Triangle read by rows: T(n,k) is the number of paths in the first quadrant from (0,0) to (n,k), consisting of steps U=(1,1), D=(1,-1), h=(1,0) and H=(2,0) (0<=k<=n). +0
4
1, 1, 1, 3, 2, 1, 6, 7, 3, 1, 16, 18, 12, 4, 1, 40, 53, 37, 18, 5, 1, 109, 148, 120, 64, 25, 6, 1, 297, 430, 369, 227, 100, 33, 7, 1, 836, 1244, 1146, 760, 385, 146, 42, 8, 1, 2377, 3656, 3519, 2518, 1391, 606, 203, 52, 9, 1, 6869, 10796, 10839, 8188, 4900, 2346, 903, 272 (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 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research