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.
%I A279704 #7 Feb 11 2019 12:06:37 %S A279704 1,3,11,42,161,617,2364,9057,34699,132938,509309,1951253,7475596, %T A279704 28640333,109726191,420380482,1610552121,6170310577,23639553244, %U A279704 90567317577,346979442819,1329339732698,5092936084549,19511940644893 %N A279704 Number of n X 3 0..1 arrays with no element equal to a strict majority of its horizontal and antidiagonal neighbors and with new values introduced in order 0 sequentially upwards. %H A279704 R. H. Hardin, <a href="/A279704/b279704.txt">Table of n, a(n) for n = 1..210</a> %F A279704 Empirical: a(n) = 5*a(n-1) - 5*a(n-2) + 2*a(n-3). %F A279704 Empirical g.f.: x*(1 - x)^2 / (1 - 5*x + 5*x^2 - 2*x^3). - _Colin Barker_, Feb 11 2019 %e A279704 Some solutions for n=4: %e A279704 ..0..1..0. .0..1..0. .0..1..0. .0..1..0. .0..1..1. .0..1..0. .0..1..1 %e A279704 ..0..1..0. .1..0..1. .0..1..0. .0..1..1. .0..0..1. .0..1..0. .0..0..1 %e A279704 ..1..0..1. .1..0..1. .0..0..1. .1..0..0. .1..0..0. .1..0..0. .0..1..1 %e A279704 ..1..0..1. .0..1..0. .1..0..1. .0..1..0. .1..1..0. .1..1..0. .0..0..1 %Y A279704 Column 3 of A279709. %K A279704 nonn %O A279704 1,2 %A A279704 _R. H. Hardin_, Dec 17 2016