A001225 Number of consistent arcs in a tournament with n nodes.

1, 2, 5, 7, 11, 14, 20, 24, 30, 35, 44, 50

Offset: 2

Author

N. J. A. Sloane

Keywords

• nonn
• nice
• hard
• more

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

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

Formula

a(n) = binomial(n,2) - A003141(n).