|
%I #5 Mar 31 2012 12:37:31
%S 9,665,25435,870686,27112487,795773818,22419183624,613401570788,
%T 16424902481420,432709421228995,11258156191933508,290080208368537797,
%U 7417347951459937609,188514123487930064371,4767959508783108762389
%N Number of (n+1)X4 0..3 arrays containing all values 0..3 with every 2X2 subblock having one or two distinct values, and new values 0..3 introduced in row major order
%C Column 3 of A209969
%H R. H. Hardin, <a href="/A209964/b209964.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 66*a(n-1) -1487*a(n-2) +11648*a(n-3) +14141*a(n-4) -454021*a(n-5) +667500*a(n-6) +5458068*a(n-7) -11933206*a(n-8) -23623289*a(n-9) +65454499*a(n-10) +26595728*a(n-11) -134617798*a(n-12) +33919512*a(n-13) +79370592*a(n-14) -38830848*a(n-15) -7503360*a(n-16) +6127616*a(n-17) -655360*a(n-18)
%e Some solutions for n=4
%e ..0..1..0..2....0..1..0..0....0..1..2..3....0..0..1..0....0..0..0..0
%e ..0..0..0..2....0..0..0..1....0..1..2..2....2..0..0..0....1..1..0..1
%e ..1..1..0..2....1..0..0..1....1..1..1..1....2..2..2..2....1..0..0..0
%e ..0..1..0..0....0..0..0..0....0..0..1..0....2..1..1..1....0..0..0..0
%e ..0..0..0..3....0..2..0..3....2..0..0..0....1..1..1..3....0..2..0..3
%K nonn
%O 1,1
%A _R. H. Hardin_ Mar 16 2012
| 