|
Search: id:A109983
|
|
|
| A109983 |
|
Triangle read by rows: T(n,k) (0<=k<=n) is the number of Delannoy paths of length n, having k steps (a Delannoy path of length n is a path from (0,0) to (n,n), consisting of steps (E=1,0), N=(0,1) and D(1,1)). |
|
+0
2
|
|
| 1, 0, 1, 2, 0, 0, 1, 6, 6, 0, 0, 0, 1, 12, 30, 20, 0, 0, 0, 0, 1, 20, 90, 140, 70, 0, 0, 0, 0, 0, 1, 30, 210, 560, 630, 252, 0, 0, 0, 0, 0, 0, 1, 42, 420, 1680, 3150, 2772, 924, 0, 0, 0, 0, 0, 0, 0, 1, 56, 756, 4200, 11550, 16632, 12012, 3432, 0, 0, 0, 0, 0, 0, 0, 0, 1, 72, 1260, 9240
(list; graph; listen)
|
|
|
Search completed in 0.002 seconds
|
