Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A011117
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A011117 Triangle of numbers S(x,y) = number of lattice paths from (0,0) to (x,y) that use step set { (0,1), (1,0), (2,0), (3,0), ....} and never pass below y = x. +0
15
1, 1, 1, 1, 2, 3, 1, 3, 7, 11, 1, 4, 12, 28, 45, 1, 5, 18, 52, 121, 197, 1, 6, 25, 84, 237, 550, 903, 1, 7, 33, 125, 403, 1119, 2591, 4279, 1, 8, 42, 176, 630, 1976, 5424, 12536, 20793, 1, 9, 52, 238, 930, 3206, 9860, 26832, 61921, 103049, 1, 10, 63 (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 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research