%I #6 Mar 31 2012 12:36:05
%S 256,3692,53462,773776,11199932,162110182,2346415828,33962540254,
%T 491581127962,7115251677062,102987693303636,1490666163351236,
%U 21576224718636722,312298946937347792,4520282557655298722
%N Number of (n+1)X2 0..3 arrays with no 2X2 subblock diagonal sum less antidiagonal sum equal to any horizontal or vertical neighbor 2X2 subblock diagonal sum less antidiagonal sum
%C Column 1 of A186200
%H R. H. Hardin, <a href="/A186197/b186197.txt">Table of n, a(n) for n = 1..200</a>
%F Empirical: a(n)=6*a(n-1)+71*a(n-2)+539*a(n-3)+2454*a(n-4)+7868*a(n-5)+8056*a(n-6)-32420*a(n-7)-165096*a(n-8)-411360*a(n-9)-936288*a(n-10)-1586880*a(n-11)-1264896*a(n-12)-331776*a(n-13)
%e Some solutions for 3X2
%e ..2..2....3..0....0..3....3..2....1..1....0..3....2..2....3..2....1..2....3..2
%e ..3..3....0..0....1..2....0..1....0..0....0..2....0..0....3..1....2..1....2..2
%e ..0..2....1..3....0..2....0..0....0..3....1..0....1..0....1..2....2..2....3..2
%K nonn
%O 1,1
%A _R. H. Hardin_ Feb 14 2011