|
%I #16 Nov 29 2018 16:00:46
%S 1,3,46,6552,11270400,335390189568,224382967916691456,
%T 4292039421591854273003520,2905990310033882693113989027594240
%N a(n) is the number of (n-2) X n normalized Latin rectangles.
%H 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 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 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 <a href="/index/La#Latin">Index entries for sequences related to Latin squares and rectangles</a>
%Y Cf. A001009.
%K nonn,more
%O 3,2
%A _Brendan McKay_ and Eric Rogoyski
%E a(11) from _Ian Wanless_, Jul 30 2010, from the 2005 McKay-Wanless paper.
| 