OFFSET
0,6
COMMENTS
Maximal number of edge-disjoint cycles of complete graph on n nodes.
REFERENCES
Bermond, J.-C. The circuit-hypergraph of a tournament. Infinite and finite sets (Colloq., Keszthely, 1973; dedicated to P. Erdős on his 60th birthday), Vol. I, pp. 165--180. Colloq. Math. Soc. Janos Bolyai, Vol. 10, North-Holland, Amsterdam, 1975. MR0396319 (53 #187)
LINKS
G. C. Greubel, Table of n, a(n) for n = 0..1000
Gary Chartrand, Dennis Gellere, Stephen Hedetniemi, Graphs with forbidden subgraphs, J. Combinatorial Theory Ser. B 10 1971 12--41. MR0285427 (44 #2645).
Jannik Dreier, Jean-Guillaume Dumas, Pascal Lafourcade, Léo Robert, Optimal Threshold Padlock Systems, arXiv:2004.11552 [cs.CR], 2020. See also hal-02552281, 2020.
FORMULA
Empirical G.f.: x^3*(x^4+x^3+x^2+1)/((1-x)^3*(1+x)^2*(x^2-x+1)*(x^2+x+1) ). - Colin Barker, Nov 18 2012
MATHEMATICA
Table[Floor[(n/3)*Floor[(n - 1)/2]], {n, 0, 50}] (* G. C. Greubel, Aug 20 2017 *)
PROG
(PARI) for(n=0, 50, print1(floor(n*floor((n-1)/2)/3), ", ")) \\ G. C. Greubel, Aug 20 2017
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Apr 10 2012
STATUS
approved