|
%I #5 Mar 31 2012 12:36:04
%S 298,5214,34678,350266,2915982,29491822,264173146,2630528360,
%T 24515504568,241032804442,2294311413454,22390251063942,
%U 215298723003602,2093763781095758,20224956581082238,196384193909326548
%N Number of (n+1)X8 binary 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 7 of A186128
%H R. H. Hardin, <a href="/A186126/b186126.txt">Table of n, a(n) for n = 1..82</a>
%e Some solutions for 3X8
%e ..0..0..1..1..0..1..1..0....1..0..0..0..1..1..0..0....1..0..1..0..1..1..0..0
%e ..0..0..0..1..1..1..1..1....1..0..0..0..0..1..1..1....0..0..0..0..1..1..1..1
%e ..1..1..0..1..1..0..0..1....0..0..1..1..0..0..0..0....0..1..0..1..1..0..1..1
%K nonn
%O 1,1
%A _R. H. Hardin_ Feb 13 2011
| 