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
1, 1, 1, 0, 3, 15, 203, 3785 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
COMMENTS
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
REFERENCES
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
Vladimír Müller, Jaroslav Nešetřil, Jan Pelant, Either tournaments or algebras?, Discrete Math. 11 (1975), 37-66. See table 1 on page 65.
Vladimír Müller, Jaroslav Nešetřil, Jan Pelant, Either tournaments or algebras?, Discrete Math. 11 (1975), 37-66. [Annotated copy] See table 1 on page 65.
CROSSREFS
See A280772 for another version.
Sequence in context: A280772 A166359 A195515 * A270354 A120601 A145272
KEYWORD
nonn,more
AUTHOR
STATUS
approved

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 April 25 12:15 EDT 2024. Contains 371969 sequences. (Running on oeis4.)