%I #5 Mar 31 2012 12:37:10
%S 60,256,1136,5728,31652,170728,943584,5175034,28475596,156707492,
%T 861735284,4742758462,26087819020,143545024690,789722083016,
%U 4344918701514,23904948840000,131519096655384,723594734816028
%N Number of (n+1)X3 0..3 arrays with every 2X3 or 3X2 subblock having exactly two equal edges, and new values 0..3 introduced in row major order
%C Column 2 of A206238
%H R. H. Hardin, <a href="/A206232/b206232.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 3*a(n-1) +20*a(n-2) -14*a(n-3) -133*a(n-4) +95*a(n-5) +123*a(n-6) +9*a(n-7) -102*a(n-8) for n>10
%e Some solutions for n=4
%e ..0..0..0....0..0..0....0..1..1....0..0..0....0..0..0....0..1..0....0..0..0
%e ..1..2..1....1..2..1....2..3..3....1..2..1....1..2..3....0..1..1....1..2..1
%e ..1..3..1....1..3..1....3..3..2....1..3..1....1..0..3....1..2..1....1..0..1
%e ..1..0..1....1..0..1....0..0..3....1..2..1....1..2..3....1..1..2....1..2..1
%e ..1..2..1....2..2..1....1..0..0....3..3..1....0..0..3....3..1..2....3..3..3
%K nonn
%O 1,1
%A _R. H. Hardin_ Feb 05 2012