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.

A279742 Number of 2 X n 0..1 arrays with no element equal to a strict majority of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.

This page as a plain text file.
%I A279742 #7 Feb 11 2019 14:20:57
%S A279742 0,2,6,14,26,48,84,146,250,426,722,1220,2056,3458,5806,9734,16298,
%T A279742 27256,45532,75986,126690,211042,351266,584204,970896,1612418,2676054,
%U A279742 4438526,7357370,12188736,20181732,33398930,55244746,91336218,150937586
%N A279742 Number of 2 X n 0..1 arrays with no element equal to a strict majority of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.
%H A279742 R. H. Hardin, <a href="/A279742/b279742.txt">Table of n, a(n) for n = 1..210</a>
%F A279742 Empirical: a(n) = 3*a(n-1) - a(n-2) - 3*a(n-3) + a(n-4) + a(n-5).
%F A279742 Empirical g.f.: 2*x^2*(1 - x^2 - 2*x^3) / ((1 - x)*(1 - x - x^2)^2). - _Colin Barker_, Feb 11 2019
%e A279742 Some solutions for n=4:
%e A279742 ..0..0..1..0. .0..1..0..0. .0..1..1..0. .0..1..1..0. .0..1..1..0
%e A279742 ..1..0..1..0. .1..0..1..0. .0..0..1..1. .0..1..0..1. .1..0..1..0
%Y A279742 Row 2 of A279741.
%K A279742 nonn
%O A279742 1,2
%A A279742 _R. H. Hardin_, Dec 18 2016