[go: up one dir, main page]

login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A003505 Number of simple tournaments with n nodes.
(Formerly M3008)
4

%I M3008 #36 Dec 26 2021 20:44:45

%S 1,1,1,0,3,15,203,3785

%N Number of simple tournaments with n nodes.

%C Why is this different from A280772, which has the same name? Possibly this is an erroneous version of A280772, in which case it should be marked as "dead", but not deleted since the OEIS policy is to include published but erroneous sequences to serve as pointers to the correct versions. - _N. J. A. Sloane_, Jan 18 2017

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

%Y See A280772 for another version.

%K nonn,more

%O 1,5

%A _N. J. A. Sloane_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 29 15:03 EDT 2024. Contains 375517 sequences. (Running on oeis4.)