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 #5 Oct 11 2015 08:35:56
%S 23966,323572,4345200,63755349,913603171,12918908831,180717447506,
%T 2526833145412,35334275421824,495175192858165,6936152367154135,
%U 97125217002643101,1359727874296720126,19035465628546193860
%N Number of (n+3)X(1+3) 0..1 arrays with each row and column not divisible by 9, read as a binary number with top and left being the most significant bits.
%C Column 1 of A263156.
%H R. H. Hardin, <a href="/A263153/b263153.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=1
%e ..1..0..0..0....0..1..0..0....0..1..0..0....0..1..0..0....1..0..0..0
%e ..0..1..0..1....1..0..1..0....0..1..0..0....1..1..1..0....1..1..0..1
%e ..1..1..0..0....1..1..1..1....1..0..1..0....0..1..1..0....1..1..1..0
%e ..1..1..1..0....0..1..1..1....1..1..1..1....0..1..1..1....0..0..0..1
%Y Cf. A263156.
%K nonn
%O 1,1
%A _R. H. Hardin_, Oct 11 2015