A120489 Number of nonisomorphic perfect 1-factorizations of complete bipartite graph K_{n,n}.

1, 1, 1, 0, 1, 0, 2, 0, 37, 0, 687121, 0

Offset

1,7

Comments

a(n) = 0 if n > 2 is even [Wanless].

References

J. Allsop and I.M. Wanless, Perfect 1-factorisations of K_{11,11}, Australasian J. Combinatorics 95 (2026), 114-130.

Barbara M. Maenhaut, Perfect 1-factorizations of complete and complete bipartite graphs, talk given at 31st Australasian Conf. Combin. Math and Combin. Computing, Alice Springs, 2006.

I.M. Wanless, Perfect factorisations of bipartite graphs and Latin squares without proper subrectangles, Electron. J. Combin. 6 (1999), R9.

Links

Table of n, a(n) for n=1..12.

I. M. Wanless, Perfect factorisations of bipartite graphs and Latin squares without proper subrectangles, Electron. J. Combin. 6 (1999) R9.

Crossrefs

Cf. A394970, A394971, A120488.

Sequence in context: A347900 A337817 A394971 * A145576 A178235 A214447

Adjacent sequences: A120486 A120487 A120488 * A120490 A120491 A120492

Keyword

nonn,more

Author

N. J. A. Sloane, Jul 22 2006

Extensions

Definition corrected by Ian Wanless, Apr 01 2008

a(11) and offset corrected by Ian Wanless Apr 08 2026

Status

approved