login
A193352
Total counts of distinct (directed) Hamiltonian paths for all simple graphs of order n.
4
0, 2, 8, 50, 416, 5616, 117308, 4862736, 435732112, 89647085656
OFFSET
1,2
LINKS
Eric Weisstein's World of Mathematics, Hamiltonian Path
CROSSREFS
Cf. A124964 (total count of directed Hamiltonian cycles for simple graphs on n nodes).
Cf. A234601 (total count of undirected cycles for simple graphs on n nodes).
Sequence in context: A121677 A120956 A000557 * A002801 A322738 A233436
KEYWORD
nonn,hard,more
AUTHOR
Eric W. Weisstein, Jul 23 2011
EXTENSIONS
a(8) from Eric W. Weisstein, Jul 24 2011
a(9) from Eric W. Weisstein, Dec 28 2013
a(10) from Eric W. Weisstein, Dec 29 2013
STATUS
approved