%I
%S 1,3,36,457,30229,8080915,15659602612
%N Number of (n+1)X(n+1) 0..1 arrays with each row divisible by 3 and each column divisible by 5, read as a binary number with top and left being the most significant bits.
%C Diagonal of A262472.
%e Some solutions for n=4
%e ..1..0..0..1..0....0..1..0..0..1....0..1..1..1..1....1..1..0..0..0
%e ..1..0..0..1..0....0..1..0..0..1....1..1..0..1..1....0..0..1..1..0
%e ..1..0..0..1..0....1..1..0..1..1....0..0..1..1..0....1..1..1..1..0
%e ..1..0..0..1..0....0..1..0..0..1....1..0..0..1..0....0..0..1..1..0
%e ..0..0..0..0..0....1..0..0..1..0....0..1..0..0..1....0..0..1..1..0
%Y Cf. A262472.
%K nonn
%O 1,2
%A _R. H. Hardin_, Sep 23 2015
