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

Terms

a(0) =1a(1) =0a(2) =0a(3) =0a(4) =0a(5) =0a(6) =0a(7) =0a(8) =0a(9) =2a(10) =2a(11) =8a(12) =8a(13) =4a(14) =0a(15) =8a(16) =0a(17) =0a(18) =20a(19) =44a(20) =52a(21) =465a(22) =276a(23) =396a(24) =988a(25) =824a(26) =560a(27) =3888a(28) =1384a(29) =3048