Number of Hamiltonian cycles in the directed graph with 2n nodes {0..2n-1} and edges from each i to 2i (mod 2n) and to 2i+1 (mod 2n).
1, 1, 1, 2, 3, 4, 7, 16, 21, 48, 93, 128, 315, 448, 675, 2048, 3825, 5376, 13797, 24576
2 seqfan posts
Tue Jun 9 09:48:51 CEST 2009 [seqfan] Re: functions f:[n]->[n] such that f[(2*x) mod n]=[2*f(x)]