cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A202464 Number of (n+2) X 3 binary arrays with no more than two of any consecutive three bits set in any row or column.

This page as a plain text file.
%I A202464 #9 Jun 01 2018 06:01:54
%S A202464 265,1573,9253,54085,317179,1858993,10894297,63850777,374215201,
%T A202464 2193190681,12853833343,75333557377,441513844561,2587618272973,
%U A202464 15165477047269,88881616706701,520916142332515,3052978074328417
%N A202464 Number of (n+2) X 3 binary arrays with no more than two of any consecutive three bits set in any row or column.
%C A202464 Column 1 of A202471.
%H A202464 R. H. Hardin, <a href="/A202464/b202464.txt">Table of n, a(n) for n = 1..210</a>
%F A202464 Empirical: a(n) = 4*a(n-1) +8*a(n-2) +18*a(n-3) -6*a(n-4) +2*a(n-5) -a(n-6).
%F A202464 Empirical g.f.: x*(265 + 513*x + 841*x^2 - 281*x^3 + 91*x^4 - 49*x^5) / (1 - 4*x - 8*x^2 - 18*x^3 + 6*x^4 - 2*x^5 + x^6). - _Colin Barker_, Jun 01 2018
%e A202464 Some solutions for n=4:
%e A202464 ..0..1..0....1..0..0....1..0..0....0..0..0....1..0..1....0..0..0....0..1..1
%e A202464 ..0..0..1....1..0..1....0..1..0....1..0..1....0..1..0....0..1..0....0..1..1
%e A202464 ..0..1..0....0..1..0....0..1..0....1..0..0....0..0..0....1..1..0....1..0..0
%e A202464 ..0..0..0....0..0..0....1..0..0....0..1..1....0..0..0....0..0..0....0..1..0
%e A202464 ..0..1..1....0..0..1....0..1..0....0..1..1....0..1..1....0..0..0....1..1..0
%e A202464 ..1..0..1....0..1..1....0..0..0....0..0..0....0..1..0....1..0..0....1..0..1
%Y A202464 Cf. A202471.
%K A202464 nonn
%O A202464 1,1
%A A202464 _R. H. Hardin_, Dec 19 2011