Triangle read by rows: T(n,k) is the number of Motzkin paths of length n and having k weak ascents (1 <= k <= ceiling(n/2)).

A114690

Triangle read by rows: T(n,k) is the number of Motzkin paths of length n and having k weak ascents (1 <= k <= ceiling(n/2)).

Terms

    a(0) =1a(1) =2a(2) =3a(3) =1a(4) =5a(5) =4a(6) =8a(7) =12a(8) =1a(9) =13a(10) =31a(11) =7a(12) =21a(13) =73a(14) =32a(15) =1a(16) =34a(17) =162a(18) =116a(19) =11a(20) =55a(21) =344a(22) =365a(23) =70a(24) =1a(25) =89a(26) =707a(27) =1041a(28) =335a(29) =16

External references