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 25 2022 21:07:35
%S 11220,20864,47776,164576,433296,1379208,3629540,13289252,35756268,
%T 128976744,346446144,1333284060,3588481008,13880081488,37224984364,
%U 148837476180,398218723908,1607711747604,4285914451420,17630641010960
%N Number of (n+1) X 9 binary arrays with no 2 X 2 subblock sum equal to any horizontal or vertical neighbor 2 X 2 subblock sum.
%C Column 8 of A185798.
%H R. H. Hardin, <a href="/A185797/b185797.txt">Table of n, a(n) for n = 1..138</a>
%e Some solutions for 3 X 9
%e ..0..0..0..0..0..1..1..0..1....0..1..1..1..0..1..1..0..0
%e ..1..1..0..0..1..1..1..0..0....0..1..0..0..0..1..1..0..1
%e ..1..0..1..0..1..1..0..0..0....0..0..1..0..0..0..0..0..1
%Y Cf. A185798.
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 04 2011