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 (a pyramid is a sequence u^pd^p or U^pd^(2p) for some positive integer p, starting at the x-axis).
A108445
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 (a pyramid is a sequence u^pd^p or U^pd^(2p) for some positive integer p, starting at the x-axis).
Terms
- a(0) =1a(1) =0a(2) =2a(3) =4a(4) =2a(5) =4a(6) =32a(7) =18a(8) =8a(9) =8a(10) =252a(11) =146a(12) =60a(13) =24a(14) =16a(15) =2112a(16) =1186a(17) =496a(18) =176a(19) =64a(20) =32a(21) =18484a(22) =10146a(23) =4148a(24) =1488a(25) =480a(26) =160a(27) =64a(28) =166976a(29) =90162
External references
- oeis: A108445