Triangle T(n,c) counting Motzkin Paths of length n with c sections starting with an up-step at level 0.
A348869
Triangle T(n,c) counting Motzkin Paths of length n with c sections starting with an up-step at level 0.
Terms
- a(0) =1a(1) =2a(2) =4a(3) =1a(4) =8a(5) =4a(6) =17a(7) =12a(8) =1a(9) =38a(10) =32a(11) =6a(12) =89a(13) =82a(14) =24a(15) =1a(16) =216a(17) =208a(18) =80a(19) =8a(20) =539a(21) =530a(22) =243a(23) =40a(24) =1a(25) =1374a(26) =1364a(27) =702a(28) =160a(29) =10
External references
- oeis: A348869