a(n) is the number of Dyck paths of (2,3)-knight moves of size n.

Terms

a(0) =1a(1) =0a(2) =0a(3) =0a(4) =1a(5) =0a(6) =1a(7) =0a(8) =2a(9) =0a(10) =7a(11) =0a(12) =7a(13) =4a(14) =38a(15) =0a(16) =52a(17) =44a(18) =192a(19) =34a(20) =445a(21) =328a(22) =1061a(23) =658a(24) =3431a(25) =2266a(26) =7293a(27) =7632a(28) =24322a(29) =17946