|
%I #4 Sep 22 2015 09:31:10
%S 86,15293,1299070,163388421,14036526126,1326209720893,114043973318270,
%T 10040316574125941,863461131233308366,74693845931156134893,
%U 6423667242365667891870,553245019071999716394661
%N Number of (n+1)X(7+1) 0..1 arrays with each row divisible by 3 and column not divisible by 3, read as a binary number with top and left being the most significant bits.
%C Column 7 of A262420.
%H R. H. Hardin, <a href="/A262419/b262419.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 86*a(n-1) +3252*a(n-2) -279672*a(n-3) -3329646*a(n-4) +286349556*a(n-5) +1544583660*a(n-6) -132834194760*a(n-7) -365579378025*a(n-8) +31439826510150*a(n-9) +46337467429704*a(n-10) -3985022198954544*a(n-11) -3102790005466128*a(n-12) +266839940470087008*a(n-13) +99548995158787584*a(n-14) -8561213583655732224*a(n-15) -1170690303846912000*a(n-16) +100679366130834432000*a(n-17) +3277061542543360000*a(n-18) -281827292658728960000*a(n-19)
%e Some solutions for n=2
%e ..1..1..1..1..0..0..1..1....1..1..1..1..1..1..1..1....1..1..1..1..1..1..0..0
%e ..1..0..0..0..1..0..1..0....0..1..0..1..0..0..0..1....1..1..0..1..0..0..1..0
%e ..1..0..0..0..0..1..1..1....1..1..0..1..0..1..0..1....1..1..1..1..1..0..0..1
%Y Cf. A262420.
%K nonn
%O 1,1
%A _R. H. Hardin_, Sep 22 2015
| 