cp's OEIS Frontend

A262761 Number of (4+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 A262761 #4 Sep 30 2015 11:04:02
%S A262761 10,100,319,1645,16450,243220,1614175,15350125,153501250,1790228500,
%T A262761 15826009375,157647278125,1576472781250,16543231412500,
%U A262761 159357016609375,1592677865078125,15926778650781250,161625340977812500
%N A262761 Number of (4+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 A262761 Row 4 of A262759.
%H A262761 R. H. Hardin, <a href="/A262761/b262761.txt">Table of n, a(n) for n = 1..210</a>
%F A262761 Empirical: a(n) = 15*a(n-1) -75*a(n-2) +375*a(n-3) +2200*a(n-4) -51750*a(n-5) +258750*a(n-6) -1293750*a(n-7) +3016875*a(n-8) +19434375*a(n-9) -97171875*a(n-10) +485859375*a(n-11) -1589281250*a(n-12) -453750000*a(n-13) +2268750000*a(n-14) -11343750000*a(n-15) +37812500000*a(n-16)
%e A262761 Some solutions for n=4
%e A262761 ..1..1..0..1..1..1....1..1..1..1..0..0....0..0..1..1..1..1....1..0..0..0..1..1
%e A262761 ..1..1..1..1..0..0....1..0..1..0..0..0....0..0..1..1..1..1....0..0..1..1..1..1
%e A262761 ..1..1..0..1..1..1....0..0..0..0..0..0....0..0..0..1..0..1....1..0..0..0..1..1
%e A262761 ..1..1..1..1..0..0....0..0..0..0..0..0....0..1..0..1..0..0....0..0..1..1..1..1
%e A262761 ..1..1..0..1..1..1....0..1..0..1..0..0....0..1..0..1..0..0....1..0..0..0..1..1
%e A262761 ..1..1..1..1..0..0....1..1..1..1..0..0....0..1..1..1..1..0....0..0..1..1..1..1
%Y A262761 Cf. A262759.
%K A262761 nonn
%O A262761 1,1
%A A262761 _R. H. Hardin_, Sep 30 2015