|
%I #5 Mar 31 2012 12:37:31
%S 762,82691,7853122,735082380,68665065250,6412474476465,
%T 598825420604059,55920736247669053,5222101046613170832,
%U 487660554256085032486,45539680595791970480828,4252676350134684608035531
%N Number of (n+1)X4 0..3 arrays containing all values 0..3 with every 2X2 subblock having one, three or four distinct values, and new values 0..3 introduced in row major order
%C Column 3 of A210086
%H R. H. Hardin, <a href="/A210081/b210081.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 111*a(n-1) -1551*a(n-2) -11620*a(n-3) +269796*a(n-4) -346276*a(n-5) -10657824*a(n-6) +37514734*a(n-7) +105399645*a(n-8) -595931403*a(n-9) +25518343*a(n-10) +3128667030*a(n-11) -3607436824*a(n-12) -4027147296*a(n-13) +9243102400*a(n-14) -2810113344*a(n-15) -3425981120*a(n-16) +1936238208*a(n-17) +61521408*a(n-18) -60604416*a(n-19)
%e Some solutions for n=4
%e ..0..1..1..0....0..0..1..2....0..0..0..0....0..0..1..0....0..0..0..0
%e ..0..2..0..2....1..2..1..0....0..0..0..0....1..2..2..3....1..2..3..1
%e ..0..1..3..2....2..3..3..3....1..2..1..3....1..3..0..2....2..0..1..0
%e ..3..1..2..0....1..2..0..2....1..3..3..2....1..2..3..2....3..2..2..1
%e ..0..1..0..1....2..3..2..1....1..0..1..1....0..1..0..3....2..1..3..3
%K nonn
%O 1,1
%A _R. H. Hardin_ Mar 17 2012
| 