cp's OEIS Frontend

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

%I A262473 #7 Dec 31 2018 20:23:43
%S A262473 4,9,36,121,484,1849,7396,29241,116964,466489,1865956,7458361,
%T A262473 29833444,119311929,477247716,1908903481,7635613924,30542106169,
%U A262473 122168424676,488672300601,1954689202404,7818751217209,31275004868836,125099997105721
%N A262473 Number of (3+1) X (n+1) 0..1 arrays with each row divisible by 3 and each column divisible by 5, read as a binary number with top and left being the most significant bits.
%H A262473 R. H. Hardin, <a href="/A262473/b262473.txt">Table of n, a(n) for n = 1..210</a>
%F A262473 Empirical: a(n) = 4*a(n-1) + 5*a(n-2) - 20*a(n-3) - 4*a(n-4) + 16*a(n-5).
%F A262473 Empirical g.f.: x*(4 - 7*x - 20*x^2 + 12*x^3 + 16*x^4) / ((1 - x)*(1 + x)*(1 - 2*x)*(1 + 2*x)*(1 - 4*x)). - _Colin Barker_, Dec 31 2018
%e A262473 Some solutions for n=4:
%e A262473 ..0..1..0..0..1....1..1..1..1..0....1..1..0..1..1....0..0..0..0..0
%e A262473 ..1..0..1..0..1....1..1..0..1..1....1..1..0..1..1....1..1..0..1..1
%e A262473 ..0..1..0..0..1....1..1..1..1..0....1..1..0..1..1....0..0..0..0..0
%e A262473 ..1..0..1..0..1....1..1..0..1..1....1..1..0..1..1....1..1..0..1..1
%Y A262473 Row 3 of A262472.
%K A262473 nonn
%O A262473 1,1
%A A262473 _R. H. Hardin_, Sep 23 2015