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 A279973 #4 Dec 24 2016 08:31:27 %S A279973 3,24,221,1922,15511,118857,876704,6281773,43997218,302544617, %T A279973 2049122034,13702872583,90643155972,593994248709,3860755349595, %U A279973 24913212937078,159737403339158,1018352525988640,6458838814490585,40774568909571868 %N A279973 Number of nX4 0..1 arrays with no element equal to a strict majority of its horizontal and antidiagonal neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards. %C A279973 Column 4 of A279977. %H A279973 R. H. Hardin, <a href="/A279973/b279973.txt">Table of n, a(n) for n = 1..210</a> %F A279973 Empirical: a(n) = 30*a(n-1) -399*a(n-2) +3163*a(n-3) -17061*a(n-4) +67920*a(n-5) -210660*a(n-6) +527724*a(n-7) -1093560*a(n-8) +1904479*a(n-9) -2816082*a(n-10) +3556545*a(n-11) -3846177*a(n-12) +3560349*a(n-13) -2812614*a(n-14) +1885732*a(n-15) -1064382*a(n-16) +500283*a(n-17) -192971*a(n-18) +59883*a(n-19) -14538*a(n-20) +2649*a(n-21) -339*a(n-22) +27*a(n-23) -a(n-24) %e A279973 Some solutions for n=4 %e A279973 ..0..1..0..1. .0..1..1..0. .0..1..1..0. .0..1..1..0. .0..1..0..0 %e A279973 ..1..1..0..1. .0..0..1..1. .1..0..1..0. .0..0..1..0. .0..1..1..1 %e A279973 ..1..0..1..1. .0..0..0..1. .1..0..0..1. .0..1..1..0. .0..0..1..0 %e A279973 ..0..1..0..1. .0..1..0..1. .0..1..0..0. .1..0..0..1. .1..1..0..1 %Y A279973 Cf. A279977. %K A279973 nonn %O A279973 1,1 %A A279973 _R. H. Hardin_, Dec 24 2016