cp's OEIS Frontend

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

%I A262919 #4 Oct 04 2015 10:15:21
%S A262919 10,27,318,1411,18190,121507,1444558,12031011,132033870,1214394787,
%T A262919 12726094798,122360994211,1252258147150,12289486776867,
%U A262919 124300598233038,1231754978783011,12386462076574030,123317516595907747
%N A262919 Number of (5+1)X(n+1) 0..1 arrays with each row divisible by 3 and each column divisible by 7, read as a binary number with top and left being the most significant bits.
%C A262919 Row 5 of A262917.
%H A262919 R. H. Hardin, <a href="/A262919/b262919.txt">Table of n, a(n) for n = 1..210</a>
%F A262919 Empirical: a(n) = 14*a(n-1) +39*a(n-2) -1106*a(n-3) +1561*a(n-4) +22386*a(n-5) -57539*a(n-6) -89894*a(n-7) +251940*a(n-8) +68600*a(n-9) -196000*a(n-10)
%e A262919 Some solutions for n=4
%e A262919 ..0..0..0..1..1....1..1..0..1..1....0..0..0..0..0....0..0..0..0..0
%e A262919 ..0..0..0..1..1....0..0..1..1..0....0..0..1..1..0....0..0..1..1..0
%e A262919 ..1..0..1..0..1....1..1..1..1..0....0..0..0..0..0....0..0..0..0..0
%e A262919 ..1..0..1..0..1....0..0..1..1..0....0..1..1..1..1....1..1..1..1..0
%e A262919 ..1..0..1..0..1....1..1..0..1..1....0..1..0..0..1....1..1..0..0..0
%e A262919 ..0..0..0..1..1....0..0..0..1..1....0..1..1..1..1....1..1..1..1..0
%Y A262919 Cf. A262917.
%K A262919 nonn
%O A262919 1,1
%A A262919 _R. H. Hardin_, Oct 04 2015