|
%I #4 Oct 29 2015 08:57:15
%S 2241,29452071,699094613961,19392931688071671,559629036639216996921,
%T 16310142164609472165404391,476531066653870544234088649641,
%U 13931367290098694757277662337480791
%N Number of (2n+1)X(7+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 7 of A263913 (nonzero terms).
%H R. H. Hardin, <a href="/A263912/b263912.txt">Table of n, a(n) for n = 1..53</a>
%F Empirical: a(n) = 41679*a(n-1) -410712498*a(n-2) +1452478559886*a(n-3) -2336950596975813*a(n-4) +1862617418228921571*a(n-5) -787558392124231703688*a(n-6) +182199417380911916513856*a(n-7) -23215178003601108008066688*a(n-8) +1584533498783486314495355136*a(n-9) -53217577938863645271064461312*a(n-10) +683124888479882769100270927872*a(n-11)
%e Some solutions for n=1
%e ..0..1..1..0..1..0..0..1..1....1..1..1..1..1..1..1..1..1
%e ..0..1..1..0..1..0..0..1..1....1..1..1..0..0..0..0..1..1
%e ..1..1..1..1..1..1..1..1..1....1..1..1..0..0..0..0..1..1
%Y Cf. A263913.
%K nonn
%O 1,1
%A _R. H. Hardin_, Oct 29 2015
| 