cp's OEIS Frontend

A262760 Number of (3+2)X(n+2) 0..1 arrays with each row divisible by 5 and each column divisible by 7, read as a binary number with top and left being the most significant bits.

%I A262760 #4 Sep 30 2015 11:03:20
%S A262760 5,25,49,129,709,4953,16705,73345,384485,2252185,9821425,47556225,
%T A262760 241769125,1278440025,6106506625,30240858625,152043549125,
%U A262760 774590745625,3814859880625,19015880330625,95252710613125,479215784705625
%N A262760 Number of (3+2)X(n+2) 0..1 arrays with each row divisible by 5 and each column divisible by 7, read as a binary number with top and left being the most significant bits.
%C A262760 Row 3 of A262759.
%H A262760 R. H. Hardin, <a href="/A262760/b262760.txt">Table of n, a(n) for n = 1..210</a>
%F A262760 Empirical: a(n) = 5*a(n-1) +290*a(n-4) -1450*a(n-5) -19200*a(n-8) +96000*a(n-9) +370750*a(n-12) -1853750*a(n-13) -1409375*a(n-16) +7046875*a(n-17)
%e A262760 Some solutions for n=4
%e A262760 ..0..1..0..1..0..0....0..0..0..0..0..0....0..0..1..0..1..0....0..0..0..0..0..0
%e A262760 ..1..1..0..1..1..1....0..0..0..0..0..0....0..0..1..0..1..0....1..1..0..0..1..0
%e A262760 ..1..1..0..1..1..1....0..0..1..0..1..0....0..0..1..0..1..0....1..1..0..1..1..1
%e A262760 ..1..0..0..0..1..1....0..0..1..0..1..0....0..0..0..0..0..0....1..1..0..1..1..1
%e A262760 ..0..0..0..0..0..0....0..0..1..0..1..0....0..0..0..0..0..0....0..0..0..1..0..1
%Y A262760 Cf. A262759.
%K A262760 nonn
%O A262760 1,1
%A A262760 _R. H. Hardin_, Sep 30 2015