A269335 - OEIS

%I #4 Aug 12 2016 07:05:19

%S 1,14,852,152922,62038644,47286888510,60138461300848

%N Number of nX3 arrays containing 3 copies of 0..n-1 avoiding the pattern equal-up in every row and column.

%C Column 3 of A269336.

%e Some solutions for n=4

%e ..0..1..1. .1..1..0. .1..0..1. .1..0..3. .0..2..1. .2..2..0. .0..2..0

%e ..3..1..2. .0..3..3. .2..1..3. .3..2..1. .1..1..0. .0..3..3. .3..3..2

%e ..3..0..2. .2..0..1. .2..0..2. .3..0..0. .3..0..2. .3..1..0. .2..1..3

%e ..0..3..2. .2..3..2. .0..3..3. .2..2..1. .3..2..3. .1..2..1. .1..1..0

%Y Cf. A269336.

%K nonn

%O 1,2

%A _R. H. Hardin_, Feb 24 2016