Triangle read by rows: a(n,k) is the number of Dyck n-paths containing k odd-length ascents.

Terms

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