This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A120489 #16 Jul 10 2023 08:29:52
%S A120489 1,1,1,0,1,0,2,0,37,0
%N A120489 Number of nonisomorphic perfect 1-factorizations of complete bipartite graph K_{n,n}.
%C A120489 a(n) = 0 if n > 2 is even [Wanless].
%D A120489 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.
%H A120489 I. M. Wanless, <a href="https://doi.org/10.37236/1441">Perfect factorisations of bipartite graphs and Latin squares without proper subrectangles</a>, Electron. J. Combin. 6 (1999) R9.
%Y A120489 Cf. A120488.
%K A120489 nonn,more
%O A120489 0,7
%A A120489 _N. J. A. Sloane_, Jul 22 2006
%E A120489 Definition corrected by _Ian Wanless_, Apr 01 2008