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 A281716 #7 Feb 20 2019 05:38:55 %S A281716 2,3,7,14,29,61,126,265,553,1162,2441,5141,10846,22921,48529,102914, %T A281716 218617,465133,991158,2115193,4520361,9673530,20728009,44469637, %U A281716 95515790,205383337,442086081,952519602,2054191833,4433875101,9578060710 %N A281716 Number of 2 X n 0..1 arrays with no element unequal to a strict majority of its horizontal, diagonal and antidiagonal neighbors and with new values introduced in order 0 sequentially upwards. %H A281716 R. H. Hardin, <a href="/A281716/b281716.txt">Table of n, a(n) for n = 1..210</a> %F A281716 Empirical: a(n) = 3*a(n-1) + a(n-2) - 6*a(n-3) - 2*a(n-4) + 4*a(n-5). %F A281716 Empirical g.f.: x*(2 - 3*x - 4*x^2 + 2*x^3 + 2*x^4) / ((1 - 2*x)*(1 - x - 3*x^2 + 2*x^4)). - _Colin Barker_, Feb 20 2019 %e A281716 Some solutions for n=4: %e A281716 ..0..0..1..1. .0..0..1..0. .0..1..1..1. .0..1..1..0. .0..1..0..0 %e A281716 ..0..1..1..1. .1..1..0..1. .1..0..0..0. .1..0..0..1. .1..0..1..1 %Y A281716 Row 2 of A281715. %K A281716 nonn %O A281716 1,1 %A A281716 _R. H. Hardin_, Jan 28 2017