1,3

CRC Handbook of Combinatorial Designs (see pages 655, 720-723).

Dinitz, Jeffrey H.; Garnick, David K.; McKay, Brendan D.; There are 526,915,620 nonisomorphic one-factorizations of K_{12}. J. Combin. Des. 2 (1994), no. 4, 273-285.

N. T. Gridgeman, Latin Squares Under Restriction and a Jumboization, J. Rec. Math., 5 (1972), 198-202.

Hartman, Alan and Rosa, Alexander, Cyclic one-factorization of the complete graph. European J. Combin. 6 (1985), no. 1, 45-48.

W. D. Wallis, 1-Factorizations of complete graphs, pp. 593-631 in J. H. Dinitz and D R. Stinson, Contemporary Design Theory, Wiley, 1992.

Index entries for sequences related to tournaments

Cf. A000474, A003191, A035481, A035483. Equals A036981 / (2n+1)!.

Sequence in context: A011788 A111152 A003191 this_sequence A061109 A013784 A158880

Adjacent sequences: A000435 A000436 A000437 this_sequence A000439 A000440 A000441

nonn,hard,nice

N. J. A. Sloane (njas(AT)research.att.com).

For K_16 the answer is approximately 1.48 * 10^44 and for K_18 1.52 * 10^63. - Dinitz et al.

a(7) found by Patric Ostergard and Petteri Kaski (petteri.kaski(AT)cs.helsinki.fi), Sep 19 2007