A038375 - OEIS

%I #22 Jan 31 2022 21:14:27

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

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

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

%D 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.

%H Code Golf Stack Exchange, <a href="https://codegolf.stackexchange.com/q/203179/53884">Spanning paths in a tournament on n nodes</a>

%H <a href="/index/To#tournament">Index entries for sequences related to tournaments</a>

%K nonn,more,hard

%O 1,3

%A _N. J. A. Sloane_.

%E a(1)=a(2)=1 prepended by _Peter Kagey_, Apr 09 2020

%E a(8)-a(10) from _Peter Kagey_, Apr 09 2020 (via Stack Exchange link)

%E a(11) from _Gordon Royle_, Jan 31 2022