Triangle read by rows: T(n,k) is the number of Motzkin paths of length n having k high humps. (A hump is an upstep followed by 0 or more flatsteps followed by a downstep. A high hump is a hump that starts at a level higher than zero.).

A097888

Triangle read by rows: T(n,k) is the number of Motzkin paths of length n having k high humps. (A hump is an upstep followed by 0 or more flatsteps followed by a downstep. A high hump is a hump that starts at a level higher than zero.).

Terms

    a(0) =1a(1) =1a(2) =2a(3) =4a(4) =8a(5) =1a(6) =16a(7) =5a(8) =32a(9) =18a(10) =1a(11) =64a(12) =56a(13) =7a(14) =128a(15) =160a(16) =34a(17) =1a(18) =256a(19) =432a(20) =138a(21) =9a(22) =512a(23) =1120a(24) =500a(25) =55a(26) =1a(27) =1024a(28) =2816a(29) =1672

External references