%I #4 Oct 29 2015 08:56:16

%S 14112,151930944,1207439092800,8931773538545760,64912419951251558112,

%T 469681539356696362061184,3394695595287389879796831360,

%U 24528928458505093713931796169120,177225579074112141647653163414682912

%N Number of (2n+2)X(6+2) 0..1 arrays with each row and column modulo 3 equal to 1, read as a binary number with top and left being the most significant bits.

%C Column 6 of A263913 (nonzero terms).

%H R. H. Hardin, <a href="/A263911/b263911.txt">Table of n, a(n) for n = 1..105</a>

%F Empirical: a(n) = 10251*a(n-1) -24588630*a(n-2) +20736364566*a(n-3) -7717648620717*a(n-4) +1351575968338575*a(n-5) -117364027613333052*a(n-6) +5003728803610496208*a(n-7) -96662904808142088000*a(n-8) +665549276803016320000*a(n-9)

%e Some solutions for n=1

%e ..1..1..0..0..0..1..1..1....0..0..0..0..0..1..0..0....0..0..0..1..0..0..0..0

%e ..0..1..1..1..1..0..0..1....1..0..0..0..1..1..1..0....0..0..1..1..0..0..0..1

%e ..1..0..0..0..1..1..1..0....1..0..0..0..0..0..1..0....0..0..0..0..0..0..0..1

%e ..0..1..0..0..1..0..0..1....1..1..1..1..0..1..1..1....1..1..0..1..1..1..1..1

%Y Cf. A263913.

%K nonn

%O 1,1

%A _R. H. Hardin_, Oct 29 2015