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 Dec 30 2023 22:07:29
%S 16771,748937,32887826,1514840541,68813532021,3170254841114,
%T 145160761315615,6677571801577027,306435724460478058,
%U 14085188244943032759,646828687624576311193,29721310285135340886450
%N Number of (n+1) X 9 binary arrays with each element of every 2 X 2 subblock being the sum mod 2 of two others.
%C Column 8 of A183845.
%H R. H. Hardin, <a href="/A183844/b183844.txt">Table of n, a(n) for n = 1..200</a>
%e Some solutions for 3 X 9
%e ..0..0..1..0..1..1..1..0..1....0..0..0..1..0..0..1..0..1
%e ..1..1..1..0..1..0..1..1..0....0..0..0..1..1..1..1..1..0
%e ..1..0..1..1..1..1..0..0..1....0..0..0..1..0..1..0..0..1
%Y Cf. A183845.
%K nonn
%O 1,1
%A _R. H. Hardin_, Jan 07 2011