|
%I #5 Mar 31 2012 12:37:32
%S 744,79017,7363642,677791782,62264517380,5718695139568,
%T 525217898009080,48237037195753208,4430181416208443992,
%U 406876280707186239248,37368290569123715949088,3431974791829880915134368
%N Number of (n+1)X4 0..3 arrays containing all values 0..3 with every 2X2 subblock having three or four distinct values, and new values 0..3 introduced in row major order
%C Column 3 of A210183
%H R. H. Hardin, <a href="/A210178/b210178.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 93*a(n-1) +199*a(n-2) -28711*a(n-3) +35176*a(n-4) +2453690*a(n-5) -5602318*a(n-6) -51561340*a(n-7) +96505796*a(n-8) +378763976*a(n-9) -653899024*a(n-10) -988302720*a(n-11) +1830649984*a(n-12) +381532160*a(n-13) -1548998656*a(n-14) +621346816*a(n-15) -44040192*a(n-16)
%e Some solutions for n=4
%e ..0..0..0..1....0..1..2..1....0..0..1..0....0..0..1..0....0..0..0..1
%e ..1..2..1..2....2..3..0..1....1..2..3..1....2..1..2..2....1..2..1..2
%e ..2..3..1..0....2..0..1..2....1..3..0..1....1..3..0..3....2..0..1..3
%e ..0..3..0..2....3..0..2..0....0..0..1..2....0..3..1..0....1..3..0..0
%e ..1..1..1..3....3..1..2..1....3..1..2..3....2..1..2..0....1..0..2..3
%K nonn
%O 1,1
%A _R. H. Hardin_ Mar 18 2012
| 