Triangle read by rows: T(n,k) is the number of peakless Motzkin paths of length n having k UHD's; here U=(1,1), H=(1,0), and D=(1,-1).
A190172
Triangle read by rows: T(n,k) is the number of peakless Motzkin paths of length n having k UHD's; here U=(1,1), H=(1,0), and D=(1,-1).
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =1a(5) =2a(6) =2a(7) =4a(8) =4a(9) =8a(10) =8a(11) =1a(12) =16a(13) =18a(14) =3a(15) =33a(16) =40a(17) =9a(18) =69a(19) =90a(20) =25a(21) =1a(22) =146a(23) =204a(24) =69a(25) =4a(26) =312a(27) =467a(28) =183a(29) =16
External references
- oeis: A190172