%I #5 Mar 31 2012 12:37:33
%S 414,27957,1575467,85724987,4628067519,249417760123,13436313660615,
%T 723757498910275,38984944780383519,2099900397267926699,
%U 113109737477748574263,6092579222040877989907,328172625066633894785487
%N Number of (n+1)X4 0..3 arrays containing all values 0..3 with every 2X2 subblock having one or three distinct values, and new values 0..3 introduced in row major order
%C Column 3 of A210309
%H R. H. Hardin, <a href="/A210304/b210304.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 81*a(n-1) -1553*a(n-2) +2061*a(n-3) +172685*a(n-4) -899169*a(n-5) -6513363*a(n-6) +44110455*a(n-7) +105719944*a(n-8) -862490004*a(n-9) -709417008*a(n-10) +7693929440*a(n-11) +1058374912*a(n-12) -32657532864*a(n-13) +6969586944*a(n-14) +63976482560*a(n-15) -23949775872*a(n-16) -51839258624*a(n-17) +18903613440*a(n-18) +14501412864*a(n-19) -3227516928*a(n-20)
%e Some solutions for n=4
%e ..0..0..0..0....0..1..1..1....0..1..0..2....0..0..0..0....0..0..0..1
%e ..0..0..0..0....1..2..3..2....2..1..2..3....0..0..0..0....1..2..1..2
%e ..0..0..0..0....3..1..1..2....2..0..1..3....1..2..3..1....2..3..1..3
%e ..0..0..0..0....0..0..2..3....1..0..2..1....1..0..2..1....3..0..0..3
%e ..1..2..3..1....0..0..1..3....3..3..3..2....3..0..1..3....3..1..2..2
%K nonn
%O 1,1
%A _R. H. Hardin_ Mar 19 2012