login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A000438 Number of 1-factorizations of K_{2n}. 7
1, 1, 6, 6240, 1225566720, 252282619805368320, 98758655816833727741338583040 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

REFERENCES

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.

LINKS

Index entries for sequences related to tournaments

CROSSREFS

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

Sequence in context: A111152 A202969 A003191 * A061109 A013784 A188979

Adjacent sequences:  A000435 A000436 A000437 * A000439 A000440 A000441

KEYWORD

nonn,hard,nice

AUTHOR

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

EXTENSIONS

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 17:13 EST 2012. Contains 205828 sequences.