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.

A208110 Number of 5 X n 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 1 1 and 1 1 0 vertically.

This page as a plain text file.
%I A208110 #9 Jun 28 2018 08:25:20
%S A208110 14,196,406,841,6235,46225,134160,389376,2189616,12313081,42602769,
%T A208110 147403881,722705166,3543344676,13461507270,51141561025,233619318395,
%U A208110 1067194368601,4261393225856,17016087003136,74907424036224
%N A208110 Number of 5 X n 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 1 1 and 1 1 0 vertically.
%C A208110 Row 5 of A208108.
%H A208110 R. H. Hardin, <a href="/A208110/b208110.txt">Table of n, a(n) for n = 1..210</a>
%F A208110 Empirical: a(n) = 2*a(n-1) + 13*a(n-3) + 166*a(n-4) - 176*a(n-5) - 143*a(n-6) - 1452*a(n-8) + 1331*a(n-9).
%F A208110 Empirical g.f.: x*(14 + 168*x + 14*x^2 - 153*x^3 - 319*x^4 - 1595*x^5 - 121*x^6 - 121*x^7 + 1331*x^8) / ((1 - 2*x - 12*x^2 + 11*x^3)*(1 + 12*x^2 - 22*x^4 - 121*x^6)). - _Colin Barker_, Jun 28 2018
%e A208110 Some solutions for n=6:
%e A208110 ..1..1..1..1..1..0....0..0..1..1..1..1....1..0..1..1..1..1....1..0..1..1..0..1
%e A208110 ..0..0..1..1..1..1....0..1..1..1..1..1....1..1..0..1..1..0....1..0..1..1..1..0
%e A208110 ..0..0..1..1..1..0....1..0..1..1..1..1....1..0..0..1..1..1....1..1..1..1..0..0
%e A208110 ..0..0..1..1..1..0....0..0..1..1..1..1....1..0..1..1..1..0....1..0..1..1..0..0
%e A208110 ..0..1..1..1..1..0....1..1..1..1..1..1....1..1..0..1..1..1....1..1..1..1..0..1
%Y A208110 Cf. A208108.
%K A208110 nonn
%O A208110 1,1
%A A208110 _R. H. Hardin_, Feb 23 2012