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!)
A003507 Number of rigid tournaments with n nodes.
(Formerly M2066)
0
1, 1, 0, 0, 2, 13, 199, 3773 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

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

Sequence in context: A239994 A242007 A049512 * A307066 A003085 A053598

Adjacent sequences:  A003504 A003505 A003506 * A003508 A003509 A003510

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 23 19:12 EST 2020. Contains 331175 sequences. (Running on oeis4.)