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

A114712

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

Terms

    a(0) =1a(1) =1a(2) =1a(3) =1a(4) =1a(5) =1a(6) =3a(7) =1a(8) =7a(9) =1a(10) =14a(11) =2a(12) =1a(13) =26a(14) =10a(15) =1a(16) =46a(17) =35a(18) =1a(19) =79a(20) =100a(21) =5a(22) =1a(23) =133a(24) =254a(25) =35a(26) =1a(27) =221a(28) =595a(29) =161

External references