Triangle read by rows: T(n,k) = number of Dyck paths of semilength n having k peaks at odd height.

Terms

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