%I #4 Aug 12 2016 07:05:17
%S 1,0,1,64,6342,3030929,3232725244,5451050692400
%N Number of nX3 arrays containing 3 copies of 0..n-1 with no element 1 greater than its north, west, southeast or southwest neighbor modulo n and the upper left element equal to 0.
%C Column 3 of A266632.
%e Some solutions for n=4
%e ..0..2..1....0..3..1....0..0..2....0..0..2....0..2..1....0..2..1....0..2..0
%e ..3..2..0....0..2..1....0..2..1....2..0..2....3..2..0....2..1..3....2..0..2
%e ..3..1..3....3..1..3....2..1..3....1..3..1....3..1..0....1..0..3....1..3..1
%e ..1..0..2....2..0..2....1..3..3....3..1..3....2..1..3....0..3..2....1..3..3
%Y Cf. A266632.
%K nonn
%O 1,4
%A _R. H. Hardin_, Jan 01 2016
|