login
Number of (2n+1)X(5+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.
1

%I #4 Oct 29 2015 08:55:25

%S 261,252097,394241389,699094613961,1279198648576981,

%T 2359070696262035857,4359072407628680510589,8058606466810736529591961,

%U 14899753037585810536219347301,27549360802535095584399290453217

%N Number of (2n+1)X(5+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 5 of A263913 (nonzero terms).

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

%F Empirical: a(n) = 2642*a(n-1) -1657924*a(n-2) +374408210*a(n-3) -37990009963*a(n-4) +1835366524700*a(n-5) -41459941330192*a(n-6) +388755630229568*a(n-7) -999778121036800*a(n-8)

%e Some solutions for n=2

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

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

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

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

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

%Y Cf. A263913.

%K nonn

%O 1,1

%A _R. H. Hardin_, Oct 29 2015