Triangle read by rows: T(n,k) is the number of peakless Motzkin paths of length n and having k UHD's starting at level 0; here U=(1,1), H=(1,0), and D=(1,-1).
A190170
Triangle read by rows: T(n,k) is the number of peakless Motzkin paths of length n and having k UHD's starting at level 0; 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) =5a(8) =3a(9) =12a(10) =4a(11) =1a(12) =27a(13) =7a(14) =3a(15) =60a(16) =16a(17) =6a(18) =135a(19) =39a(20) =10a(21) =1a(22) =309a(23) =92a(24) =18a(25) =4a(26) =717a(27) =212a(28) =39a(29) =10
External references
- oeis: A190170