A193352 Total counts of distinct (directed) Hamiltonian paths for all simple graphs of order n.

0, 2, 8, 50, 416, 5616, 117308, 4862736, 435732112, 89647085656

Offset

1,2

Links

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

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

Adjacent sequences: A193349 A193350 A193351 * A193353 A193354 A193355

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