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 A279711 #4 Dec 17 2016 13:25:09 %S A279711 8,13,42,125,385,1195,3751,11823,37385,118390,375114,1188640,3766483, %T A279711 11934903,37818803,119840838,379760607,1203429425,3813594984, %U A279711 12085090793,38297085876,121361690893,384589567332,1218746480798,3862151137416 %N A279711 Number of 4Xn 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. %C A279711 Row 4 of A279709. %H A279711 R. H. Hardin, <a href="/A279711/b279711.txt">Table of n, a(n) for n = 1..210</a> %F A279711 Empirical: a(n) = 8*a(n-1) -24*a(n-2) +31*a(n-3) +2*a(n-4) -66*a(n-5) +96*a(n-6) -50*a(n-7) -14*a(n-8) -18*a(n-9) +77*a(n-10) +32*a(n-11) -243*a(n-12) +257*a(n-13) +22*a(n-14) -117*a(n-15) +3*a(n-16) -28*a(n-17) +17*a(n-18) +7*a(n-19) +5*a(n-20) +3*a(n-21) +a(n-23) for n>25 %e A279711 Some solutions for n=4 %e A279711 ..0..1..0..0. .0..1..1..0. .0..1..0..1. .0..1..0..1. .0..1..0..1 %e A279711 ..0..1..1..0. .0..0..1..0. .0..1..1..0. .0..1..0..1. .0..1..0..0 %e A279711 ..0..0..1..1. .1..0..0..1. .0..0..0..1. .1..0..0..1. .0..1..1..0 %e A279711 ..1..0..0..1. .0..1..0..1. .1..1..0..1. .1..1..0..1. .1..0..1..0 %Y A279711 Cf. A279709. %K A279711 nonn %O A279711 1,1 %A A279711 _R. H. Hardin_, Dec 17 2016