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.

A281797 Number of nX3 0..1 arrays with no element unequal to a strict majority of its horizontal, diagonal and antidiagonal neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards.

This page as a plain text file.
%I A281797 #5 Jan 30 2017 10:34:16
%S A281797 0,6,75,324,865,2272,5191,11141,22705,44611,85366,160212,296306,
%T A281797 541784,981579,1764938,3153155,5602160,9905073,17437719,30580597,
%U A281797 53442733,93101164,161719796,280165812,484172898,834830159,1436409132,2466624753
%N A281797 Number of nX3 0..1 arrays with no element unequal to a strict majority of its horizontal, diagonal and antidiagonal neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards.
%C A281797 Column 3 of A281802.
%H A281797 R. H. Hardin, <a href="/A281797/b281797.txt">Table of n, a(n) for n = 1..210</a>
%F A281797 Empirical: a(n) = 6*a(n-1) -12*a(n-2) +5*a(n-3) +12*a(n-4) -12*a(n-5) -3*a(n-6) +6*a(n-7) -a(n-9) for n>16
%e A281797 Some solutions for n=4
%e A281797 ..0..0..0. .0..1..0. .0..0..0. .0..1..1. .0..0..0. .0..0..1. .0..1..1
%e A281797 ..0..0..1. .0..0..1. .1..0..0. .0..0..1. .0..0..1. .0..1..1. .1..0..1
%e A281797 ..0..1..0. .0..0..0. .0..1..1. .1..0..0. .0..0..1. .1..0..1. .1..1..0
%e A281797 ..0..0..1. .0..0..0. .1..0..0. .0..0..0. .0..0..0. .1..1..1. .1..0..0
%Y A281797 Cf. A281802.
%K A281797 nonn
%O A281797 1,2
%A A281797 _R. H. Hardin_, Jan 30 2017