login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

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

Table of n, a(n) for n=1..8.

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.

Index entries for sequences related to tournaments

CROSSREFS

See A280772 for another version.

Sequence in context: A280772 A166359 A195515 * A270354 A120601 A145272

Adjacent sequences:  A003502 A003503 A003504 * A003506 A003507 A003508

KEYWORD

nonn,more

AUTHOR

N. J. A. Sloane.

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 21 05:39 EST 2020. Contains 331104 sequences. (Running on oeis4.)