|
Search: id:A010683
|
|
|
| A010683 |
|
Let S(x,y) = number of lattice paths from (0,0) to (x,y) that use the step set { (0,1), (1,0), (2,0), (3,0), ....} and never pass below y = x. Sequence gives S(n-1,n) = number of `Schroeder' trees with n+1 leaves and root of deg. 2. |
|
+0
6
|
|
| 1, 2, 7, 28, 121, 550, 2591, 12536, 61921, 310954, 1582791, 8147796, 42344121, 221866446, 1170747519, 6216189936, 33186295681, 178034219986, 959260792775, 5188835909516, 28167068630713, 153395382655222
(list; graph; listen)
|
|
|
Search completed in 0.002 seconds
|
