Number of Hamiltonian cycles in the undirected simple graph G_n with vertices 1,...,n which has an edge connecting vertices i and j if and only if |i-j| is prime.
A228626
Number of Hamiltonian cycles in the undirected simple graph G_n with vertices 1,...,n which has an edge connecting vertices i and j if and only if |i-j| is prime.
Terms
- a(0) =0a(1) =0a(2) =0a(3) =0a(4) =1a(5) =2a(6) =4a(7) =16a(8) =60a(9) =186a(10) =433a(11) =2215a(12) =11788a(13) =76539a(14) =414240a(15) =2202215a(16) =9655287a(17) =69748712a(18) =444195809a(19) =3703859949a(20) =26688275292a(21) =201673532931
External references
- oeis: A228626