Triangle read by rows: T(n,k) = number of colored weighted Motzkin paths ending at (n,k).

Terms

a(0) =1a(1) =6a(2) =1a(3) =40a(4) =10a(5) =1a(6) =280a(7) =84a(8) =14a(9) =1a(10) =2016a(11) =672a(12) =144a(13) =18a(14) =1a(15) =14784a(16) =5280a(17) =1320a(18) =220a(19) =22a(20) =1a(21) =109824a(22) =41184a(23) =11440a(24) =2288a(25) =312a(26) =26a(27) =1a(28) =823680a(29) =320320