

A096368


Number of unlabeled regular tournaments with 2n+1 nodes.


7




OFFSET

1,3


REFERENCES

Gunnar Brinkmann, Generating regular directed graphs, Discrete Math., 313 (2012), 17.  From N. J. A. Sloane, Nov 26 2012


LINKS

Table of n, a(n) for n=1..7.
Marc Chamberland and Eugene A. Herman, Rockpaperscissors meets Borromean rings, The Mathematical Intelligencer, to appear c. 2015.
Marc Chamberland, What's Better than Rock Paper Scissors? (2014).
B. D. McKay, Catalogues of directed graphs.


CROSSREFS

Cf. A007079.
Sequence in context: A012766 A012796 A231656 * A016066 A012848 A202621
Adjacent sequences: A096365 A096366 A096367 * A096369 A096370 A096371


KEYWORD

more,nonn


AUTHOR

David J. Haglin (david.haglin(AT)mnsu.edu), Jul 02 2004


EXTENSIONS

Offset and count for 15 vertices corrected by Brendan McKay, Dec 09 2008


STATUS

approved



