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 A266166 #19 Nov 15 2017 02:57:49 %S A266166 1,0,1,2,18,0,342480,7850589120,7188534981260640 %N A266166 Number of reduced pairs of orthogonal Latin squares. %C A266166 A pair of orthogonal Latin squares is reduced if their first rows are in natural order and so is the first column of the first square. %H A266166 J. Egan and I. M. Wanless, <a href="http://dx.doi.org/10.1090/mcom/3010">Enumeration of MOLS of small order</a>, Mathematics of Computation 85, 2016, 799-824. %H A266166 Stepan Kochemazov, Oleg Zaikin, Alexander Semenov, <a href="https://dx.doi.org/10.23919/MIPRO.2017.7973600">Runtime Estimation for Enumerating all Mutually Orthogonal Diagonal Latin Squares of Order 10</a>, 2017 40th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO). <a href="http://docs.mipro-proceedings.com/cis/cis_18_4252.pdf">PDF download</a> %H A266166 Ian Wanless, <a href="http://users.monash.edu.au/~iwanless/data/MOLS/">Data on MOLS</a> %Y A266166 Sequence A072377 is obtained from this sequence by multiplying by n!n!(n-1)!/2 (except when n=1). %K A266166 nonn,nice,more %O A266166 1,4 %A A266166 _Ian Wanless_, Dec 22 2015