cp's OEIS Frontend

A263054 Number of (n+1) X (2+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 A263054 #8 Jan 01 2019 08:43:52
%S A263054 2,33,142,895,4314,22921,113486,577071,2877562,14455993,72225582,
%T A263054 361607935,1807659674,9041669481,45205690126,226052092111,
%U A263054 1130241870522,5651375017753,28256745002222,141284885366175,706423516399834
%N A263054 Number of (n+1) X (2+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.
%H A263054 R. H. Hardin, <a href="/A263054/b263054.txt">Table of n, a(n) for n = 1..210</a>
%F A263054 Empirical: a(n) = 5*a(n-1) + 12*a(n-2) - 60*a(n-3) - 39*a(n-4) + 195*a(n-5) + 28*a(n-6) - 140*a(n-7).
%F A263054 Empirical g.f.: x*(2 + 23*x - 47*x^2 - 91*x^3 + 193*x^4 + 28*x^5 - 140*x^6) / ((1 - x)*(1 + x)*(1 - 2*x)*(1 + 2*x)*(1 - 5*x)*(1 - 7*x^2)). - _Colin Barker_, Jan 01 2019
%e A263054 Some solutions for n=4:
%e A263054 ..1..0..1....0..0..1....1..0..0....1..0..0....1..0..1....1..0..1....1..0..0
%e A263054 ..1..1..1....1..0..0....0..1..0....0..1..0....1..0..1....0..0..1....1..0..1
%e A263054 ..1..1..1....1..1..1....1..1..1....0..1..0....0..0..1....1..1..1....0..1..0
%e A263054 ..1..1..1....0..0..1....1..0..0....0..1..0....0..1..0....1..0..0....0..0..1
%e A263054 ..1..0..1....1..1..1....0..1..0....1..0..1....1..0..0....0..0..1....1..1..1
%Y A263054 Column 2 of A263060.
%K A263054 nonn
%O A263054 1,1
%A A263054 _R. H. Hardin_, Oct 08 2015