The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #5 Aug 12 2016 07:05:16
%S 0,0,1,32,4954,878953,192333677,53404173562,18545695848787,
%T 7914432322153846
%N Number of nX3 arrays containing 3 copies of 0..n-1 with no equal horizontal, vertical or antidiagonal neighbors and new values introduced sequentially from 0.
%C Column 3 of A265373.
%e Some solutions for n=4
%e ..0..1..0....0..1..2....0..1..2....0..1..2....0..1..2....0..1..2....0..1..2
%e ..2..3..2....3..0..3....2..0..3....3..0..1....3..0..1....2..3..0....2..3..0
%e ..1..0..3....1..2..1....1..2..0....1..3..2....2..3..0....1..2..3....1..2..1
%e ..3..1..2....0..3..2....3..1..3....2..0..3....1..2..3....3..1..0....3..0..3
%Y Cf. A265373.
%K nonn
%O 1,4
%A _R. H. Hardin_, Dec 07 2015