[go: up one dir, main page]

login
A001225
Number of consistent arcs in a tournament with n nodes.
(Formerly M1333 N0510)
2
1, 2, 5, 7, 11, 14, 20, 24, 30, 35, 44, 50
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
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
FORMULA
a(n) = binomial(n,2) - A003141(n).
CROSSREFS
Cf. A003141.
Sequence in context: A184676 A191175 A191125 * A372621 A157001 A134640
KEYWORD
nonn,nice,hard,more
STATUS
approved