%I #4 Aug 12 2016 07:05:18
%S 1,0,17,999,328701,200359723,215846101578,368357739503591,
%T 933148612656280367
%N Number of nX3 arrays containing 3 copies of 0..n-1 with no element 1 greater than its north or southwest neighbor modulo n and the upper left element equal to 0.
%C Column 3 of A266861.
%e Some solutions for n=4
%e ..0..3..1....0..2..0....0..2..3....0..2..3....0..2..0....0..1..0....0..2..3
%e ..0..1..0....3..2..3....2..0..1....2..0..1....0..1..2....3..1..3....2..1..1
%e ..2..1..3....2..0..1....1..2..3....1..2..3....2..3..1....2..1..3....2..3..1
%e ..2..3..2....1..3..1....3..0..1....0..1..3....1..3..3....2..0..2....0..3..0
%Y Cf. A266861.
%K nonn
%O 1,3
%A _R. H. Hardin_, Jan 04 2016
|