cp's OEIS Frontend

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

%I A263058 #4 Oct 08 2015 15:00:32
%S A263058 42,22921,1941702,232738767,19763462754,1825928130193,155157177242886,
%T A263058 13464303796343791,1144373527121975682,97776065732064546321,
%U A263058 8310794250378741921702,707331447947977777389487
%N A263058 Number of (n+1)X(6+1) 0..1 arrays with each row and column not divisible by 3, read as a binary number with top and left being the most significant bits.
%C A263058 Column 6 of A263060.
%H A263058 R. H. Hardin, <a href="/A263058/b263058.txt">Table of n, a(n) for n = 1..210</a>
%F A263058 Empirical: a(n) = 85*a(n-1) +3026*a(n-2) -257210*a(n-3) -2725780*a(n-4) +231691300*a(n-5) +1042604066*a(n-6) -88621345610*a(n-7) -184834243867*a(n-8) +15710910728695*a(n-9) +16148556399500*a(n-10) -1372627293957500*a(n-11) -690707626945552*a(n-12) +58710148290371920*a(n-13) +13366198928883008*a(n-14) -1136126908955055680*a(n-15) -92117546962355200*a(n-16) +7829991491800192000*a(n-17)
%e A263058 Some solutions for n=2
%e A263058 ..1..0..0..1..1..0..0....1..0..0..0..0..1..1....0..0..1..1..1..0..1
%e A263058 ..1..0..0..0..1..1..1....0..1..0..1..0..0..0....1..0..1..1..0..0..0
%e A263058 ..1..1..1..1..1..0..0....0..0..1..0..1..0..0....0..1..1..1..0..1..1
%Y A263058 Cf. A263060.
%K A263058 nonn
%O A263058 1,1
%A A263058 _R. H. Hardin_, Oct 08 2015