%I #5 Oct 13 2015 12:20:39
%S 42,156,482,1512,4610,14140,42420,129444,391642,1180480,3544794,
%T 10655576,31976778,95976140,287978714,864145200,2592435600,7778832336,
%U 23338786082,70020174204,210062812650,630202940556,1890615691586,5671878371544
%N Number of (n+3)X(2+3) 0..1 arrays with each row divisible by 11 and column not divisible by 11, read as a binary number with top and left being the most significant bits.
%C Column 2 of A263288.
%H R. H. Hardin, <a href="/A263285/b263285.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 3*a(n-1) -a(n-2) +3*a(n-3) -a(n-4) +3*a(n-5) -a(n-6) +3*a(n-7) -a(n-8) +3*a(n-9) +706*a(n-10) -2118*a(n-11) +706*a(n-12) -2118*a(n-13) +706*a(n-14) -2118*a(n-15) +706*a(n-16) -2118*a(n-17) +706*a(n-18) -2118*a(n-19) -15709*a(n-20) +47127*a(n-21) -15709*a(n-22) +47127*a(n-23) -15709*a(n-24) +47127*a(n-25) -15709*a(n-26) +47127*a(n-27) -15709*a(n-28) +47127*a(n-29)
%e Some solutions for n=4
%e ..1..0..1..1..0....0..0..0..0..0....0..1..0..1..1....1..0..1..1..0
%e ..0..1..0..1..1....1..0..1..1..0....0..1..0..1..1....0..1..0..1..1
%e ..0..1..0..1..1....0..1..0..1..1....1..0..1..1..0....0..1..0..1..1
%e ..0..1..0..1..1....1..0..1..1..0....0..1..0..1..1....1..0..1..1..0
%e ..1..0..1..1..0....0..1..0..1..1....0..0..0..0..0....1..0..1..1..0
%e ..0..0..0..0..0....0..0..0..0..0....1..0..1..1..0....1..0..1..1..0
%e ..0..1..0..1..1....0..1..0..1..1....0..1..0..1..1....0..1..0..1..1
%Y Cf. A263288.
%K nonn
%O 1,1
%A _R. H. Hardin_, Oct 13 2015