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 A281711 #4 Jan 28 2017 13:42:33 %S A281711 2,14,38,97,245,631,1625,4234,11017,28652,74521,193836,504195,1311543, %T A281711 3411786,8875377,23088294,60062126,156247057,406466099,1057396975, %U A281711 2750760479,7155964344,18615901819,48428431650,125984478749,327743372244 %N A281711 Number of nX4 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. %C A281711 Column 4 of A281715. %H A281711 R. H. Hardin, <a href="/A281711/b281711.txt">Table of n, a(n) for n = 1..210</a> %F A281711 Empirical: a(n) = 4*a(n-1) -2*a(n-2) -4*a(n-3) -2*a(n-4) +a(n-5) +7*a(n-6) +a(n-7) -10*a(n-8) -a(n-9) +27*a(n-10) -8*a(n-11) -18*a(n-12) +8*a(n-13) +a(n-14) -3*a(n-15) for n>16 %e A281711 Some solutions for n=4 %e A281711 ..0..0..1..1. .0..0..1..1. .0..0..1..0. .0..0..1..1. .0..0..0..1 %e A281711 ..0..0..1..1. .0..1..1..1. .0..1..0..1. .0..1..1..1. .0..0..1..0 %e A281711 ..0..1..0..1. .0..0..1..1. .1..0..1..0. .0..0..1..1. .0..1..0..1 %e A281711 ..1..0..1..0. .0..0..1..1. .0..1..0..1. .0..0..0..0. .1..0..1..0 %Y A281711 Cf. A281715. %K A281711 nonn %O A281711 1,1 %A A281711 _R. H. Hardin_, Jan 28 2017