A038375 Maximal number of spanning paths in a tournament on n nodes.

1, 1, 3, 5, 15, 45, 189, 661, 3357, 15745, 95095

Offset

1,3

References

J. W. Moon, Topics on Tournaments. Holt, NY, 1968, p. 28.

K. B. Reid and L. W. Beineke "Tournaments", pp. 169-204 in L. W. Beineke and R. J. Wilson, editors, Selected Topics in Graph Theory, Academic Press, NY, 1978.

Links

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

Code Golf Stack Exchange, Spanning paths in a tournament on n nodes

Index entries for sequences related to tournaments

Crossrefs

Sequence in context: A119472 A018568 A371903 * A103043 A018601 A190733

Adjacent sequences: A038372 A038373 A038374 * A038376 A038377 A038378

Keyword

nonn,more,hard

Author

N. J. A. Sloane.

Extensions

a(1)=a(2)=1 prepended by Peter Kagey, Apr 09 2020

a(8)-a(10) from Peter Kagey, Apr 09 2020 (via Stack Exchange link)

a(11) from Gordon Royle, Jan 31 2022

Status

approved