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 #4 Sep 30 2015 11:00:05
%S 7,17,49,319,1345,6193,39751,229841,1339569,8663743,55835745,
%T 358608881,2379031207,15973282577,107339155889,729414305599,
%U 4997779808385,34344305727921,237112117127431,1643074583243345,11416088795366577
%N Number of (n+2)X(3+2) 0..1 arrays with each row divisible by 5 and each column divisible by 7, read as a binary number with top and left being the most significant bits.
%C Column 3 of A262759.
%H R. H. Hardin, <a href="/A262754/b262754.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=4
%e ..0..1..1..1..1....0..1..1..1..1....1..1..1..1..0....0..1..0..1..0
%e ..0..1..1..1..1....0..1..1..1..1....0..0..0..0..0....0..1..1..1..1
%e ..0..1..1..1..1....1..1..1..1..0....0..0..0..0..0....0..1..1..1..1
%e ..1..1..0..0..1....1..0..1..0..0....0..0..0..0..0....0..1..1..1..1
%e ..1..1..0..0..1....1..0..1..0..0....1..1..1..1..0....0..1..0..1..0
%e ..1..1..0..0..1....0..0..1..0..1....1..1..1..1..0....0..1..0..1..0
%Y Cf. A262759.
%K nonn
%O 1,1
%A _R. H. Hardin_, Sep 30 2015