cp's OEIS Frontend

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.

A072377 Number of pairs of orthogonal Latin squares of order n.

Original entry on oeis.org

1, 0, 36, 3456, 3110400, 0, 3131834388480000, 32162058365970677760000, 19083454070548282639185346560000
Offset: 1

Views

Author

Eric W. Weisstein, Jul 19 2002

Keywords

Comments

This sequence counts unordered pairs. The number of ordered pairs of MOLS is exactly double this sequence.

Crossrefs

Equals n!n!(n-1)!/2 times A266166 (except for the degenerate case n=1). Cf. A000315, A002860, A266167, A266168, A266169, A266170, A266171, A266172, A266173.

Extensions

More terms (and corrected the degenerate first term) from Ian Wanless, Dec 22 2015