The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #11 Feb 26 2018 03:09:03
%S 1,2,12,4464,75502080
%N Number of n X n arrays containing n copies of 0..n-1 with row sums equal and column sums equal.
%C Diagonal of A265089.
%C Cf. Latin squares A002860.
%e Some solutions for n=4
%e ..0..2..1..3....3..3..0..0....3..1..2..0....1..0..2..3....2..1..0..3
%e ..3..1..2..0....0..2..3..1....2..3..1..0....2..3..1..0....3..1..2..0
%e ..0..2..1..3....1..1..1..3....0..2..1..3....1..3..2..0....1..2..3..0
%e ..3..1..2..0....2..0..2..2....1..0..2..3....2..0..1..3....0..2..1..3
%Y Cf. A265089, A002860.
%K nonn,more
%O 1,2
%A _R. H. Hardin_, Dec 01 2015