login

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”).

A003507
Number of rigid tournaments with n nodes.
(Formerly M2066)
0
1, 1, 0, 0, 2, 13, 199, 3773
OFFSET
1,5
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 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
Sequence in context: A242007 A376550 A049512 * A338979 A307066 A361368
KEYWORD
nonn,more
STATUS
approved