Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I M2066 #19 Dec 26 2021 20:44:55
%S 1,1,0,0,2,13,199,3773
%N Number of rigid tournaments with n nodes.
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H Vladimír Müller, Jaroslav Jaroslav Nešetřil, Jan Pelant, <a href="http://dx.doi.org/10.1016/0012-365X(75)90104-1">Either tournaments or algebras?</a>, Discrete Math. 11 (1975), 37-66. See table 1 on page 65.
%H Vladimír Müller, Jaroslav Nešetřil, Jan Pelant, <a href="/A003505/a003505.pdf">Either tournaments or algebras?</a>, Discrete Math. 11 (1975), 37-66. [Annotated copy] See table 1 on page 65.
%H <a href="/index/To#tournament">Index entries for sequences related to tournaments</a>
%K nonn,more
%O 1,5
%A _N. J. A. Sloane_