%I #5 Mar 31 2012 12:37:12
%S 15,171,2532,38810,597829,9217211,142130380,2191712741,33797293408,
%T 521171299118,8036724854275,123930361123673,1911068840711956,
%U 29469647972560031,454436874891109270,7007646425074694210
%N Number of (n+1)X2 0..3 arrays with every 2X3 or 3X2 subblock having no more than three equal edges, and new values 0..3 introduced in row major order
%C Column 1 of A206600
%H R. H. Hardin, <a href="/A206594/b206594.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 16*a(n-1) -14*a(n-2) +98*a(n-3) -312*a(n-4) +114*a(n-5) -585*a(n-6) +72*a(n-7) -324*a(n-8) for n>9
%e Some solutions for n=4
%e ..0..1....0..1....0..0....0..0....0..0....0..0....0..1....0..0....0..0....0..1
%e ..2..0....1..2....1..0....0..1....1..1....1..0....0..2....1..2....0..0....0..0
%e ..2..2....1..2....2..3....0..2....1..0....0..2....1..1....1..3....1..2....1..1
%e ..1..0....3..0....2..1....3..2....2..3....0..3....1..0....0..0....2..3....0..0
%e ..3..2....1..2....1..0....3..1....0..1....0..2....3..2....1..3....2..3....1..0
%K nonn
%O 1,1
%A _R. H. Hardin_ Feb 09 2012