Triangle read by rows: T(n,k) is the number of dispersed Dyck paths of length n (i.e., Motzkin paths of length n with no (1,0) steps at positive heights) with k HUs, where U=(1,1) and H=(1,0).
A191320
Triangle read by rows: T(n,k) is the number of dispersed Dyck paths of length n (i.e., Motzkin paths of length n with no (1,0) steps at positive heights) with k HUs, where U=(1,1) and H=(1,0).
Terms
- a(0) =1a(1) =1a(2) =2a(3) =2a(4) =1a(5) =4a(6) =2a(7) =4a(8) =6a(9) =9a(10) =10a(11) =1a(12) =9a(13) =23a(14) =3a(15) =23a(16) =36a(17) =11a(18) =23a(19) =77a(20) =25a(21) =1a(22) =65a(23) =118a(24) =65a(25) =4a(26) =65a(27) =249a(28) =131a(29) =17
External references
- oeis: A191320