cp's OEIS Frontend

A262467 Number of (n+1)X(3+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 A262467 #4 Sep 23 2015 18:48:15
%S A262467 1,6,36,115,469,2622,15732,85723,494605,2942190,17653140,105022051,
%T A262467 628157125,3765830046,22594980276,135471987115,812624087485,
%U A262467 4875367337166,29252204022996,175502212001971,1052990612251381
%N A262467 Number of (n+1)X(3+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.
%C A262467 Column 3 of A262472.
%H A262467 R. H. Hardin, <a href="/A262467/b262467.txt">Table of n, a(n) for n = 1..210</a>
%F A262467 Empirical: a(n) = 11*a(n-1) -49*a(n-2) +179*a(n-3) -382*a(n-4) -478*a(n-5) +4682*a(n-6) -20542*a(n-7) +61367*a(n-8) -104077*a(n-9) +152183*a(n-10) -136453*a(n-11) -60984*a(n-12) +104544*a(n-13) -156816*a(n-14) +156816*a(n-15)
%e A262467 Some solutions for n=4
%e A262467 ..0..1..1..0....0..0..1..1....1..1..1..1....0..0..0..0....1..1..0..0
%e A262467 ..0..1..1..0....0..0..1..1....1..0..0..1....0..1..1..0....0..0..0..0
%e A262467 ..0..1..1..0....1..1..0..0....0..1..1..0....0..0..0..0....1..1..1..1
%e A262467 ..0..1..1..0....0..0..0..0....0..0..0..0....0..1..1..0....0..0..0..0
%e A262467 ..0..0..0..0....1..1..1..1....1..0..0..1....0..0..0..0....0..0..1..1
%Y A262467 Cf. A262472.
%K A262467 nonn
%O A262467 1,2
%A A262467 _R. H. Hardin_, Sep 23 2015