%I #5 Mar 31 2012 12:37:31
%S 75,1271,20871,332891,5169813,78792305,1184416509,17624469579,
%T 260264902127,3821147552379,55850881366677,813499248661201,
%U 11816892350999277,171285288093188555,2478576674689280655
%N Number of (n+1)X4 0..2 arrays containing all values 0..2 with every 2X2 subblock having two distinct values, and new values 0..2 introduced in row major order
%C Column 3 of A210052
%H R. H. Hardin, <a href="/A210047/b210047.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 24*a(n-1) -89*a(n-2) -977*a(n-3) +3094*a(n-4) +13063*a(n-5) -28268*a(n-6) -71414*a(n-7) +90536*a(n-8) +163472*a(n-9) -114928*a(n-10) -148256*a(n-11) +54080*a(n-12) +35328*a(n-13) -9216*a(n-14)
%e Some solutions for n=4
%e ..0..0..0..0....0..1..0..1....0..1..0..1....0..0..0..1....0..0..0..0
%e ..0..1..1..0....1..0..0..0....1..0..0..0....2..2..0..0....0..1..0..2
%e ..0..0..1..0....1..0..2..2....0..0..1..0....1..2..0..1....0..1..0..2
%e ..1..0..0..0....1..0..2..1....1..1..0..0....2..2..0..0....1..0..0..2
%e ..1..0..2..0....1..0..2..1....1..0..0..2....0..2..2..0....1..0..2..0
%K nonn
%O 1,1
%A _R. H. Hardin_ Mar 16 2012