Triangle read by rows: T(n, k) = number of hill-free Dyck paths (i.e., no peaks at height 1) of semilength n and having k peaks.

A100754

Triangle read by rows: T(n, k) = number of hill-free Dyck paths (i.e., no peaks at height 1) of semilength n and having k peaks.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =1a(4) =4a(5) =1a(6) =1a(7) =8a(8) =8a(9) =1a(10) =1a(11) =13a(12) =29a(13) =13a(14) =1a(15) =1a(16) =19a(17) =73a(18) =73a(19) =19a(20) =1a(21) =1a(22) =26a(23) =151a(24) =266a(25) =151a(26) =26a(27) =1a(28) =1a(29) =34

External references