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.

A269077 Number of 3 X n binary arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling two not more than once.

This page as a plain text file.
%I A269077 #7 Jan 18 2019 14:38:58
%S A269077 8,32,123,521,1887,7477,27042,102070,368391,1351259,4850557,17489481,
%T A269077 62373468,222422348,788291635,2789267661,9831173339,34583332541,
%U A269077 121320954422,424799241314,1484281289599,5177412026719,18028809567225
%N A269077 Number of 3 X n binary arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling two not more than once.
%H A269077 R. H. Hardin, <a href="/A269077/b269077.txt">Table of n, a(n) for n = 1..210</a>
%F A269077 Empirical: a(n) = 4*a(n-1) + 8*a(n-2) - 34*a(n-3) - 16*a(n-4) + 60*a(n-5) - 25*a(n-6).
%F A269077 Empirical g.f.: x*(8 - 69*x^2 + 45*x^3 + 35*x^4 - 25*x^5) / (1 - 2*x - 6*x^2 + 5*x^3)^2. - _Colin Barker_, Jan 18 2019
%e A269077 Some solutions for n=4:
%e A269077 ..1..0..1..0. .0..0..0..0. .1..0..0..0. .1..0..0..0. .0..0..0..1
%e A269077 ..0..0..0..1. .0..0..1..0. .0..0..0..0. .0..1..0..1. .0..0..1..0
%e A269077 ..1..0..0..1. .1..0..1..0. .0..0..0..0. .0..1..0..1. .1..0..1..0
%Y A269077 Row 3 of A269075.
%K A269077 nonn
%O A269077 1,1
%A A269077 _R. H. Hardin_, Feb 19 2016