login
A124964
Total counts of distinct (directed) Hamiltonian cycles for all simple graphs of order n.
2
0, 0, 2, 10, 58, 616, 9932, 333386, 25153932, 4548577688
OFFSET
1,3
LINKS
Eric Weisstein's World of Mathematics, Hamiltonian Cycle
CROSSREFS
Cf. A193352 (total numbers of directed Hamiltonian paths for simple graphs on n nodes).
Cf. A234601 (total numbers of undirected cycles for simple graphs on n nodes).
Sequence in context: A293111 A112369 A218944 * A026132 A226996 A370247
KEYWORD
nonn,more,hard
AUTHOR
Eric W. Weisstein, Nov 14 2006
EXTENSIONS
a(7)-a(10) from Eric W. Weisstein, Jul 23-24 2011
STATUS
approved