%I #4 Oct 08 2015 14:58:31
%S 10,142,1666,18390,188370,1941702,19499266,196698070,1968558130,
%T 19732383462,197355588066,1974792933750,19748600169490,
%U 197518001324422,1975194815632066,19752765325169430,197527991815422450
%N Number of (n+1)X(3+1) 0..1 arrays with each row and column not divisible by 3, read as a binary number with top and left being the most significant bits.
%C Column 3 of A263060.
%H R. H. Hardin, <a href="/A263055/b263055.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 11*a(n-1) +35*a(n-2) -495*a(n-3) -114*a(n-4) +6204*a(n-5) -4040*a(n-6) -17600*a(n-7) +16000*a(n-8)
%e Some solutions for n=4
%e ..1..0..1..0....1..1..1..0....1..1..0..1....1..1..0..1....1..0..1..1
%e ..1..1..0..1....0..1..1..1....0..0..1..0....0..0..0..1....0..1..0..1
%e ..1..0..1..0....0..1..1..1....0..0..0..1....1..0..1..1....0..0..1..0
%e ..0..0..1..0....0..0..0..1....1..0..1..0....1..0..0..0....1..1..0..1
%e ..1..0..0..0....1..0..1..0....1..0..0..0....1..0..1..1....1..0..0..0
%Y Cf. A263060.
%K nonn
%O 1,1
%A _R. H. Hardin_, Oct 08 2015
|