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 A279974 #4 Dec 24 2016 08:32:15 %S A279974 3,62,822,10491,124030,1393359,15071233,158391708,1627160233, %T A279974 16409869901,162982613326,1598047779214,15497697410287, %U A279974 148874926975376,1418326347449973,13414045478319926,126045765506261814 %N A279974 Number of nX5 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 A279974 Column 5 of A279977. %H A279974 R. H. Hardin, <a href="/A279974/b279974.txt">Table of n, a(n) for n = 1..210</a> %F A279974 Empirical: a(n) = 53*a(n-1) -1291*a(n-2) +19418*a(n-3) -204835*a(n-4) +1632329*a(n-5) -10324115*a(n-6) +53654890*a(n-7) -234937934*a(n-8) +882771616*a(n-9) -2885212091*a(n-10) +8285140483*a(n-11) -21058509124*a(n-12) +47630930849*a(n-13) -96230469370*a(n-14) +174085724937*a(n-15) -282388861308*a(n-16) +410961960219*a(n-17) -536498538568*a(n-18) +627876381653*a(n-19) -658110830698*a(n-20) +617080503289*a(n-21) -516968320637*a(n-22) +386461849324*a(n-23) -257438979196*a(n-24) +152574757688*a(n-25) -80292463252*a(n-26) +37420429652*a(n-27) -15389322205*a(n-28) +5557085609*a(n-29) -1749901992*a(n-30) +476005587*a(n-31) -110393019*a(n-32) +21427460*a(n-33) -3388972*a(n-34) +419408*a(n-35) -38032*a(n-36) +2240*a(n-37) -64*a(n-38) for n>39 %e A279974 Some solutions for n=4 %e A279974 ..0..1..1..1..0. .0..1..0..0..0. .0..1..0..0..1. .0..0..1..0..1 %e A279974 ..0..0..0..1..1. .0..1..0..1..1. .0..1..1..1..0. .1..1..0..1..0 %e A279974 ..0..1..0..0..1. .0..0..0..0..1. .1..0..1..1..0. .0..0..1..1..1 %e A279974 ..0..1..1..0..1. .0..1..0..1..0. .1..0..0..1..1. .1..0..1..0..1 %Y A279974 Cf. A279977. %K A279974 nonn %O A279974 1,1 %A A279974 _R. H. Hardin_, Dec 24 2016