%I #5 Mar 31 2012 12:36:02
%S 404,5068,56558,678268,8069858,96721922,1158080514,13877927240,
%T 166291456824,1992796227622,23880775897200,286180659773378,
%U 3429500713226098,41098227703695822,492510011724491808
%N Number of (n+1)X3 0..3 arrays with every 2X2 subblock diagonal sum less antidiagonal sum equal to some horizontal or vertical neighbor 2X2 subblock diagonal sum less antidiagonal sum
%C Column 2 of A185640
%H R. H. Hardin, <a href="/A185638/b185638.txt">Table of n, a(n) for n = 1..200</a>
%e Some solutions for 5X3
%e ..2..0..2....0..0..3....2..0..2....2..0..0....2..2..2....0..0..2....2..2..2
%e ..3..1..3....0..0..3....2..1..2....1..0..1....3..3..3....2..2..3....3..3..3
%e ..0..0..2....0..0..1....2..2..2....3..3..3....3..2..1....3..3..3....1..1..0
%e ..1..3..3....1..1..0....2..3..2....2..2..1....1..2..3....2..3..3....2..2..0
%e ..2..2..0....0..1..1....1..3..1....2..2..1....2..1..0....0..2..2....3..3..1
%K nonn
%O 1,1
%A _R. H. Hardin_ Feb 01 2011