The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #3 Oct 12 2015 10:53:27
%S 5416302,395174691,25864201119,1606472091969,94851590043422,
%T 5666950847883973,336423212979882403,19908435853180444585,
%U 1174504708839557685998
%N Number of (n+3)X(3+3) 0..1 arrays with each row and column not divisible by 15, read as a binary number with top and left being the most significant bits.
%C Column 3 of A263215.
%e Some solutions for n=1
%e ..0..0..0..1..1..0....0..1..0..1..1..0....0..1..0..1..1..1....0..1..0..0..0..0
%e ..0..0..0..0..1..1....0..0..0..0..1..1....0..0..0..1..1..1....0..1..0..1..1..0
%e ..0..1..0..1..0..1....0..0..0..1..1..0....0..0..1..0..1..0....0..0..1..0..1..1
%e ..1..0..1..0..0..1....1..0..1..0..0..1....1..1..0..1..0..1....1..1..0..0..0..0
%Y Cf. A263215.
%K nonn
%O 1,1
%A _R. H. Hardin_, Oct 12 2015