Triangle T(n,k) giving number of hill-free Dyck paths of length 2n and having height of first peak equal to k.

A065602

Triangle T(n,k) giving number of hill-free Dyck paths of length 2n and having height of first peak equal to k.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =3a(4) =2a(5) =1a(6) =8a(7) =6a(8) =3a(9) =1a(10) =24a(11) =18a(12) =10a(13) =4a(14) =1a(15) =75a(16) =57a(17) =33a(18) =15a(19) =5a(20) =1a(21) =243a(22) =186a(23) =111a(24) =54a(25) =21a(26) =6a(27) =1a(28) =808a(29) =622

External references