|
%I #4 Oct 04 2015 10:16:19
%S 19,61,1207,7417,152587,1550557,30497815,420921961,7895204299,
%T 126160746301,2313326012887,39531526974937,720265713036427,
%U 12724622932131997,232102910290030615,4177632885527495881
%N Number of (6+1)X(n+1) 0..1 arrays with each row divisible by 3 and each column divisible by 7, read as a binary number with top and left being the most significant bits.
%C Row 6 of A262917.
%H R. H. Hardin, <a href="/A262920/b262920.txt">Table of n, a(n) for n = 1..210</a>
%H R. H. Hardin, <a href="/A262920/a262920.txt">Empirical recurrence of order 65</a>
%F Empirical recurrence of order 65 (see link above)
%e Some solutions for n=4
%e ..0..0..0..1..1....0..0..1..1..0....0..0..1..1..0....0..0..0..0..0
%e ..0..0..0..1..1....1..1..1..1..0....1..0..0..1..0....0..1..1..1..1
%e ..0..1..0..0..1....1..1..1..1..0....1..1..0..1..1....0..0..1..1..0
%e ..0..0..0..0..0....1..1..0..1..1....1..1..0..1..1....1..0..0..1..0
%e ..0..1..1..0..0....0..1..1..1..1....0..1..1..1..1....1..0..0..1..0
%e ..0..0..1..1..0....0..1..1..1..1....0..0..1..1..0....1..1..0..1..1
%e ..0..1..1..0..0....0..1..1..0..0....0..0..0..0..0....0..1..1..1..1
%Y Cf. A262917.
%K nonn
%O 1,1
%A _R. H. Hardin_, Oct 04 2015
| 