Triangle read by rows: T(n,k) is the number of Motzkin paths of length n having k ascents (0<=k<=floor(n/2)); an ascent is a maximal string of upsteps.

A114580

Triangle read by rows: T(n,k) is the number of Motzkin paths of length n having k ascents (0<=k<=floor(n/2)); an ascent is a maximal string of upsteps.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =1a(4) =1a(5) =3a(6) =1a(7) =7a(8) =1a(9) =1a(10) =14a(11) =6a(12) =1a(13) =26a(14) =23a(15) =1a(16) =1a(17) =46a(18) =70a(19) =10a(20) =1a(21) =79a(22) =186a(23) =56a(24) =1a(25) =1a(26) =133a(27) =451a(28) =235a(29) =15

External references