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

A114711

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

Terms

    a(0) =1a(1) =1a(2) =2a(3) =3a(4) =1a(5) =5a(6) =3a(7) =8a(8) =9a(9) =13a(10) =22a(11) =2a(12) =21a(13) =51a(14) =10a(15) =34a(16) =111a(17) =40a(18) =55a(19) =233a(20) =130a(21) =5a(22) =89a(23) =474a(24) =380a(25) =35a(26) =144a(27) =942a(28) =1022a(29) =175

External references