Search: id:A000479 Results 1-1 of 1 results found. %I A000479 %S A000479 1,1,1,2,24,1344,1128960,12198297600,2697818265354240, %T A000479 15224734061278915461120,2750892211809148994633229926400, %U A000479 19464657391668924966616671344752852992000 %N A000479 Number of 1-factorizations of K_{n,n}. %C A000479 Also, number of latin squares of order n with first row 1,2,...,n. %C A000479 Also number of fixed diagonal Latin squares of order n. - Eric Weisstein (eric(AT)weisstein.com), Dec 18, 2005 %C A000479 Also maximum number of Latin squares of order n such that no two of them have all the same rows (respectively, columns). - Rick L. Shepherd (rshepherd2(AT)hotmail.com), Mar 01 2008 %D A000479 CRC Handbook of Combinatorial Designs, 1996, p. 660. %D A000479 Denes and Keedwell, Latin Squares and Applications, Academic Press 1974. %D A000479 B. D. McKay and I. M. Wanless, On the number of Latin squares. Preprint 2004. http://cs.anu.edu.au/~bdm/papers/ls11.pdf %H A000479 B. D. McKay, A. Meynert and W. Myrvold, Small Latin Squares, Quasigroups and Loops, J. Combin. Designs, to appear (2005). %H A000479 B. D. McKay and I. M. Wanless, On the number of Latin squares, Ann. Combinat. 9 (2005) 335-344. %H A000479 Eric Weisstein's World of Mathematics, Latin Square %Y A000479 a(n) = A000315(n)*(n-1)! = A002860(n)/n!. Cf. A000528. %Y A000479 Sequence in context: A137887 A094050 A028365 this_sequence A111427 A081955 A163086 %Y A000479 Adjacent sequences: A000476 A000477 A000478 this_sequence A000480 A000481 A000482 %K A000479 nonn,hard,nice %O A000479 0,4 %A A000479 N. J. A. Sloane (njas(AT)research.att.com). %E A000479 One more term (from the McKay-Wanless article) from Richard Bean (rwb(AT)eskimo.com), Feb 17 2004 Search completed in 0.001 seconds