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 A000576 #16 Nov 29 2018 16:00:46 %S A000576 1,3,46,6552,11270400,335390189568,224382967916691456, %T A000576 4292039421591854273003520,2905990310033882693113989027594240 %N A000576 a(n) is the number of (n-2) X n normalized Latin rectangles. %H A000576 B. D. McKay and I. M. Wanless, <a href="http://dx.doi.org/10.1007/s00026-005-0261-7">On the number of Latin squares</a>, Ann. Combinat. 9 (2005) 335-344. %H A000576 D. S. Stones, <a href="http://www.combinatorics.org/ojs/index.php/eljc/article/view/v17i1a1">The many formulas for the number of Latin rectangles</a>, Electron. J. Combin 17 (2010), A1. %H A000576 D. S. Stones and I. M. Wanless, <a href="http://dx.doi.org/10.1016/j.jcta.2009.03.019">Divisors of the number of Latin rectangles</a>, J. Combin. Theory Ser. A 117 (2010), 204-215. %H A000576 <a href="/index/La#Latin">Index entries for sequences related to Latin squares and rectangles</a> %Y A000576 Cf. A001009. %K A000576 nonn,more %O A000576 3,2 %A A000576 _Brendan McKay_ and Eric Rogoyski %E A000576 a(11) from _Ian Wanless_, Jul 30 2010, from the 2005 McKay-Wanless paper.