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.

A208291 Number of 7 X n 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 1 1 0 vertically.

This page as a plain text file.
%I A208291 #8 Jun 30 2018 14:53:47
%S A208291 14,196,966,6650,40376,256774,1604862,10095932,63357434,397965218,
%T A208291 2498872432,15692738782,98544531778,618833962068,3886089661790,
%U A208291 24403526661710,153246991242128,962346508543154,6043255215031230
%N A208291 Number of 7 X n 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 1 1 0 vertically.
%C A208291 Row 7 of A208287.
%H A208291 R. H. Hardin, <a href="/A208291/b208291.txt">Table of n, a(n) for n = 1..210</a>
%F A208291 Empirical: a(n) = 4*a(n-1) + 16*a(n-2) - 7*a(n-3) - 23*a(n-4) + 2*a(n-5) + 9*a(n-6) - a(n-8).
%F A208291 Empirical g.f.: 14*x*(1 + x)*(1 + 9*x - 12*x^2 - 6*x^3 + 7*x^4 + x^5 - x^6) / (1 - 4*x - 16*x^2 + 7*x^3 + 23*x^4 - 2*x^5 - 9*x^6 + x^8). - _Colin Barker_, Jun 30 2018
%e A208291 Some solutions for n=4:
%e A208291 ..0..1..0..1....0..1..1..1....1..0..1..1....0..1..1..1....1..0..1..0
%e A208291 ..1..0..1..0....1..1..0..0....1..0..1..0....1..0..1..1....1..0..1..0
%e A208291 ..0..1..0..0....1..1..0..1....1..0..1..0....1..0..1..1....1..0..1..0
%e A208291 ..1..1..0..0....1..1..0..0....1..0..1..0....1..0..1..1....1..0..1..0
%e A208291 ..0..1..0..0....1..1..0..1....1..0..1..0....1..0..1..1....1..0..1..0
%e A208291 ..1..1..0..0....1..1..0..0....1..0..1..0....1..0..1..1....1..0..1..0
%e A208291 ..0..1..0..0....1..1..0..0....1..0..1..0....1..0..1..1....1..0..1..0
%Y A208291 Cf. A208287.
%K A208291 nonn
%O A208291 1,1
%A A208291 _R. H. Hardin_, Feb 25 2012