|
%I #7 Jan 14 2017 09:39:01
%S 2240,823680,346131968,153876579840,70577422755840,33021546171494400,
%T 15664518350357381120,7506428481300850827264,
%U 3625062729947846895239168,1761398107886979915147182080,860111024347049203759900262400
%N 1/32 the number of (n+1) X 9 binary arrays with equal numbers of 2 X 2 subblocks with sum mod two being 0 and 1.
%C Column 8 of A183772.
%H R. H. Hardin, <a href="/A183771/b183771.txt">Table of n, a(n) for n = 1..29</a>
%e Some solutions for 3 X 9:
%e ..0..0..0..0..0..0..0..0..0....0..0..0..0..0..0..0..0..1
%e ..0..0..1..1..0..0..0..1..0....0..1..1..1..1..0..0..1..0
%e ..0..1..0..1..1..1..0..1..0....1..0..1..0..1..0..0..0..0
%K nonn
%O 1,1
%A _R. H. Hardin_, Jan 06 2011
| 