Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #7 Jan 14 2017 09:38:39
%S 160,14784,1555840,173065984,19855042560,2323234636800,
%T 275588031713280,33021546171494400,3987331943727333376,
%U 484411726089672392704,59141557731461248942080,7250125459895693790478336
%N 1/32 the number of (n+1) X 7 binary arrays with equal numbers of 2 X 2 subblocks with sum mod two being 0 and 1.
%C Column 6 of A183772.
%H R. H. Hardin, <a href="/A183769/b183769.txt">Table of n, a(n) for n = 1..75</a>
%e Some solutions for 3 X 7:
%e ..0..0..0..1..0..0..1....0..0..0..0..0..1..0....0..0..0..0..1..1..0
%e ..0..1..1..0..0..1..1....0..0..1..0..0..0..1....1..1..0..1..1..0..1
%e ..0..0..0..1..1..1..1....1..0..1..1..0..0..1....1..1..0..0..0..1..1
%K nonn
%O 1,1
%A _R. H. Hardin_, Jan 06 2011