|
%I #11 Mar 23 2019 03:29:41
%S 1,1,1,1,1,5,3,85,15,13333,1223,19434757,1495297,276013571133,
%T 18400989629
%N Number of (semi-)regular tournaments of order n.
%C A tournament of odd order n is regular if the out-degree of each vertex is (n-1)/2. A tournament of even order n is semi-regular if the out-degree of each vertex is n/2-1 or n/2.
%H B. McKay, <a href="http://users.cecs.anu.edu.au/~bdm/data/digraphs.html">Digraphs</a>
%Y Cf. A000568, A096368.
%K nonn,hard,more
%O 1,6
%A _Danny Rorabaugh_, Feb 27 2015
%E a(1)-a(2) prepended and a(14)-a(15) added by _Brendan McKay_, Mar 21 2019
|
