cp's OEIS Frontend

A262753 Number of (n+2) X (2+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 A262753 #7 Dec 31 2018 20:23:50
%S A262753 4,9,25,100,361,1369,5476,21609,85849,343396,1371241,5480281,21921124,
%T A262753 87665769,350625625,1402502500,5609860201,22439141209,89756564836,
%U A262753 359025060969,1436097847129,5744391388516,22977555967081,91910204694361
%N A262753 Number of (n+2) X (2+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.
%H A262753 R. H. Hardin, <a href="/A262753/b262753.txt">Table of n, a(n) for n = 1..210</a>
%F A262753 Empirical: a(n) = 4*a(n-1) + 9*a(n-3) - 36*a(n-4) - 8*a(n-6) + 32*a(n-7).
%F A262753 Empirical g.f.: x*(4 - 7*x - 11*x^2 - 36*x^3 + 24*x^4 + 24*x^5 + 32*x^6) / ((1 - x)*(1 - 2*x)*(1 - 4*x)*(1 + x + x^2)*(1 + 2*x + 4*x^2)). - _Colin Barker_, Dec 31 2018
%e A262753 Some solutions for n=4:
%e A262753 ..0..1..0..1....1..1..1..1....1..0..1..0....1..0..1..0....1..0..1..0
%e A262753 ..0..0..0..0....1..1..1..1....1..0..1..0....1..0..1..0....1..0..1..0
%e A262753 ..0..0..0..0....1..0..1..0....1..0..1..0....1..1..1..1....0..1..0..1
%e A262753 ..1..0..1..0....1..0..1..0....1..0..1..0....1..1..1..1....0..1..0..1
%e A262753 ..1..1..1..1....1..0..1..0....1..0..1..0....1..1..1..1....0..1..0..1
%e A262753 ..1..1..1..1....1..1..1..1....1..0..1..0....1..0..1..0....1..0..1..0
%Y A262753 Column 2 of A262759.
%K A262753 nonn
%O A262753 1,1
%A A262753 _R. H. Hardin_, Sep 30 2015