|
Search: id:A108451
|
|
|
| A108451 |
|
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 pyramids of the first kind (a pyramid of the first kind is a sequence u^pd^p for some positive integer p, starting at the x-axis). |
|
+0
3
|
|
| 1, 1, 1, 6, 3, 1, 44, 16, 5, 1, 344, 116, 30, 7, 1, 2856, 928, 224, 48, 9, 1, 24816, 7856, 1840, 376, 70, 11, 1, 223016, 69264, 15912, 3184, 580, 96, 13, 1, 2056256, 629472, 142592, 28176, 5080, 844, 126, 15, 1, 19344472, 5855472, 1312360, 256992, 46072
(list; table; graph; listen)
|
|
|
Search completed in 0.002 seconds
|
