A001225 - OEIS

%I M1333 N0510 #39 Aug 28 2021 02:53:48

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

%N Number of consistent arcs in a tournament with n nodes.

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

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%H J.-C. Bermond, <a href="http://www.numdam.org/item?id=MSH_1972__37__5_0">Ordres à distance minimum d'un tournoi et graphes partiels sans circuits maximaux</a>, Math. Sci. Hum., No. 37 (1972), 5-25.

%H J.-C. Bermond, <a href="/A003141/a003141.pdf">Ordres à distance minimum d'un tournoi et graphes partiels sans circuits maximaux</a>, Math. Sci. Hum., No. 37 (1972), 5-25. [Annotated scanned copy]

%H K. B. Reid, <a href="http://dx.doi.org/10.4153/CMB-1969-032-x">On sets of arcs containing no cycles in tournaments</a>, Canad. Math. Bull., 12 (1969), 261-264.

%H N. J. A. Sloane and K. B. Reid, <a href="/A001225/a001225.pdf">Correspondence concerning this sequence</a>

%H <a href="/index/To#tournament">Index entries for sequences related to tournaments</a>

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

%Y Cf. A003141.

%K nonn,nice,hard,more

%O 2,2

%A _N. J. A. Sloane_