|
%I #5 Mar 31 2012 12:37:32
%S 101,3283,89293,2266901,55406625,1323907951,31194685583,728618654983,
%T 16924786006687,391770747425385,9048653573565509,208704389188320759,
%U 4809477953050228735,110770487003358715391,2550345502157173838959
%N Number of (n+1)X4 0..3 arrays containing all values 0..3 with every 2X2 subblock having two or four distinct values, and new values 0..3 introduced in row major order
%C Column 3 of A210174
%H R. H. Hardin, <a href="/A210169/b210169.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 63*a(n-1) -1431*a(n-2) +12729*a(n-3) +3336*a(n-4) -726316*a(n-5) +2597781*a(n-6) +14573977*a(n-7) -80969613*a(n-8) -143169465*a(n-9) +1105985892*a(n-10) +755457488*a(n-11) -8134284268*a(n-12) -2199693420*a(n-13) +33945204080*a(n-14) +3581733232*a(n-15) -80566448928*a(n-16) -3198195264*a(n-17) +104642408704*a(n-18) +1573518080*a(n-19) -66575366656*a(n-20) -375523328*a(n-21) +15376932864*a(n-22) -161906688*a(n-23) -629932032*a(n-24)
%e Some solutions for n=4
%e ..0..1..0..0....0..0..0..0....0..1..1..1....0..0..1..2....0..0..0..0
%e ..0..0..1..0....0..1..0..1....0..0..0..1....3..3..2..1....0..1..1..0
%e ..0..1..0..0....0..0..1..1....0..1..0..0....2..2..2..1....1..0..1..0
%e ..1..1..0..1....2..2..3..1....0..1..1..1....0..2..1..1....1..0..0..1
%e ..1..2..3..2....2..0..1..1....2..3..1..2....3..1..2..1....1..0..2..3
%K nonn
%O 1,1
%A _R. H. Hardin_ Mar 18 2012
| 