Triangle read by rows: T(n,k) is the number of hill-free Dyck paths of semilength n and having k UUDD's, where U=(1,1) and D=(1,-1) (0<=k<=floor(n/2), n>=2). A hill in a Dyck path is a peak at level 1.
A105640
Triangle read by rows: T(n,k) is the number of hill-free Dyck paths of semilength n and having k UUDD's, where U=(1,1) and D=(1,-1) (0<=k<=floor(n/2), n>=2). A hill in a Dyck path is a peak at level 1.
Terms
- a(0) =0a(1) =1a(2) =1a(3) =1a(4) =2a(5) =3a(6) =1a(7) =5a(8) =10a(9) =3a(10) =14a(11) =29a(12) =13a(13) =1a(14) =39a(15) =89a(16) =52a(17) =6a(18) =111a(19) =279a(20) =195a(21) =36a(22) =1a(23) =322a(24) =881a(25) =722a(26) =185a(27) =10a(28) =947a(29) =2806
External references
- oeis: A105640