A001225 Number of consistent arcs in a tournament with n nodes. (Formerly M1333 N0510)

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

Table of n, a(n) for n=2..13.

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

Formula

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

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