A269478 - OEIS

%I #6 Apr 05 2023 08:26:56

%S 1,14,574,36028,3572724,548242672,121353398100

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

%C Column 3 of A269479.

%e Some solutions for n=4

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

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

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

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

%Y Cf. A269479.

%K nonn

%O 1,2

%A _R. H. Hardin_, Feb 27 2016