Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k pyramids.

Terms

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