|
%I #6 Aug 12 2016 06:53:58
%S 1,10,92,888,8880,91180,955320,10168092,109595168,1193414004,
%T 13106207640,144965453160,1613228920704,18047090084256,
%U 202816635014976,2288462757997500,25913609592575040,294366270662992612
%N Number of 3Xn arrays containing n copies of 0..3-1 with no equal antidiagonal neighbors and new values introduced sequentially from 0.
%C Row 3 of A265241.
%H R. H. Hardin, <a href="/A265242/b265242.txt">Table of n, a(n) for n = 1..109</a>
%e Some solutions for n=4
%e ..0..0..0..0....0..0..1..0....0..1..1..1....0..1..0..2....0..0..1..1
%e ..1..1..2..2....2..2..1..2....2..0..2..0....0..1..1..1....2..2..0..1
%e ..2..1..1..2....1..2..1..0....2..0..2..1....2..2..0..2....0..1..2..2
%Y Cf. A265241.
%K nonn
%O 1,2
%A _R. H. Hardin_, Dec 06 2015
| 