Number of (undirected) Hamiltonian paths on the first n cells of the 8 X ceiling(n/8) 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) =0a(11) =0a(12) =0a(13) =0a(14) =0a(15) =0a(16) =0a(17) =0a(18) =0a(19) =0a(20) =0a(21) =24a(22) =276a(23) =396a(24) =164a(25) =1034a(26) =3470a(27) =6404a(28) =5555a(29) =74927