|
%I #5 Mar 31 2012 12:37:31
%S 893,70923,5258039,385841179,28267925909,2070471867089,
%T 151644743405597,11106638825609387,813462442022950735,
%U 59578874503149148763,4363621497207730378229,319596378000027147845681
%N Number of (n+1)X4 0..2 arrays containing all values 0..2 with every 2X2 subblock having two or three distinct values, and new values 0..2 introduced in row major order
%C Column 3 of A210012
%H R. H. Hardin, <a href="/A210007/b210007.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 75*a(n-1) -30*a(n-2) -7001*a(n-3) -18089*a(n-4) +52126*a(n-5) +91400*a(n-6) -118464*a(n-7) -92992*a(n-8) +85632*a(n-9) -13824*a(n-10)
%e Some solutions for n=4
%e ..0..0..0..1....0..0..0..0....0..0..0..0....0..0..0..1....0..0..0..0
%e ..2..0..1..1....0..1..0..1....0..1..2..1....2..0..1..0....1..0..1..0
%e ..2..1..1..0....1..2..2..2....0..0..2..0....0..2..1..1....2..1..0..0
%e ..1..2..0..1....1..2..0..2....0..2..1..2....2..0..0..1....2..0..0..1
%e ..1..2..0..2....1..2..1..1....1..1..1..1....2..2..2..1....2..0..1..1
%K nonn
%O 1,1
%A _R. H. Hardin_ Mar 16 2012
| 