A334123 Number of labeled tournaments on n vertices with the maximum number of Hamiltonian paths.

1, 2, 2, 24, 64, 480

Offset

1,2

Comments

The maximum number of Hamiltonian paths in a tournament on n vertices is given by A038375.

Links

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

Example

For n = 4, the a(4) = 24 labeled tournaments with A038375(4) = 5 Hamiltonian paths are all isomorphic to the tournament on vertices {1,2,3,4} with edges {(1,2),(1,3),(2,3),(2,4),(3,4),(4,1)}, which have the following Hamiltonian paths:
1->2->3->4,
2->3->4->1,
3->4->1->2,
4->1->2->3, and
2->4->1->3.

Crossrefs

Cf. A038375.

Sequence in context: A131448 A156447 A272641 * A127261 A239531 A194130

Adjacent sequences: A334120 A334121 A334122 * A334124 A334125 A334126

Keyword

nonn,more

Author

J. E. Paguyo and Peter Kagey, Apr 14 2020

Status

approved