The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #4 Oct 10 2015 07:08:17
%S 912,28048,316392,3049840,16751376,216762400,2168966344,20154887792,
%T 138240703248,1449388911184,14047136614696,130631050676464,
%U 1009951152099984,9665650741329760,91463371579618312,848124382235101936
%N Number of (n+3)X(4+3) 0..1 arrays with each row divisible by 15 and column not divisible by 15, read as a binary number with top and left being the most significant bits.
%C Column 4 of A263124.
%H R. H. Hardin, <a href="/A263122/b263122.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=2
%e ..1..1..0..1..0..0..1....0..0..1..1..1..1..0....0..0..0..0..0..0..0
%e ..1..1..1..1..0..0..0....1..1..1..1..0..0..0....0..1..1..1..1..0..0
%e ..0..0..0..1..1..1..1....0..0..1..1..1..1..0....1..1..1..1..0..0..0
%e ..1..1..0..1..0..0..1....0..1..0..1..1..0..1....1..0..0..1..0..1..1
%e ..1..0..0..1..0..1..1....0..1..1..1..1..0..0....0..0..0..0..0..0..0
%Y Cf. A263124.
%K nonn
%O 1,1
%A _R. H. Hardin_, Oct 10 2015