login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A001225 Consistent arcs in a tournament (equals C(n,2) - A003141).
(Formerly M1333 N0510)
2
1, 2, 5, 7, 11, 14, 20, 24, 30, 35 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,2

REFERENCES

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

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=2..11.

J.-C. Bermond, Ordres à distance minimum d'un tournoi et graphes partiels sans circuits maximaux, Math. Sci. Hum., No. 37 (1972), 5-25.

J.-C. Bermond, Ordres à distance minimum d'un tournoi et graphes partiels sans circuits maximaux, Math. Sci. Hum., No. 37 (1972), 5-25. [Annotated scanned copy]

K. B. Reid, On sets of arcs containing no cycles in tournaments, Canad. Math. Bull., 12 (1969), 261-264.

N. J. A. Sloane and K. B. Reid, Correspondence concerning this sequence

Index entries for sequences related to tournaments

CROSSREFS

Cf. A003141.

Sequence in context: A184676 A191175 A191125 * A157001 A134640 A216094

Adjacent sequences:  A001222 A001223 A001224 * A001226 A001227 A001228

KEYWORD

nonn,nice,hard,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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 13 00:17 EST 2017. Contains 295954 sequences.