Number of (undirected) Hamiltonian paths on the first n cells of the 4 X ceiling(n/4) knight graph.

Terms

a(0) =1a(1) =0a(2) =0a(3) =0a(4) =0a(5) =0a(6) =0a(7) =0a(8) =0a(9) =0a(10) =2a(11) =8a(12) =0a(13) =16a(14) =40a(15) =0a(16) =0a(17) =20a(18) =144a(19) =82a(20) =0a(21) =269a(22) =1172a(23) =744a(24) =0a(25) =2643a(26) =13711a(27) =6378a(28) =0a(29) =15192