A124964 Total counts of distinct (directed) Hamiltonian cycles for all simple graphs of order n.

0, 0, 2, 10, 58, 616, 9932, 333386, 25153932, 4548577688

Offset

1,3

Links

Table of n, a(n) for n=1..10.

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

Adjacent sequences: A124961 A124962 A124963 * A124965 A124966 A124967

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