Triangle read by rows: T(n,k) is the number of Motzkin paths of length n with k valleys (n>=0, 0<=k<=floor(n/2)-1; a valley is a downstep followed by an upstep).
A097885
Triangle read by rows: T(n,k) is the number of Motzkin paths of length n with k valleys (n>=0, 0<=k<=floor(n/2)-1; a valley is a downstep followed by an upstep).
Terms
- a(0) =1a(1) =1a(2) =2a(3) =4a(4) =8a(5) =1a(6) =17a(7) =4a(8) =37a(9) =13a(10) =1a(11) =82a(12) =40a(13) =5a(14) =185a(15) =116a(16) =21a(17) =1a(18) =423a(19) =326a(20) =80a(21) =6a(22) =978a(23) =899a(24) =279a(25) =31a(26) =1a(27) =2283a(28) =2444a(29) =924
External references
- oeis: A097885