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 A279743 #4 Dec 18 2016 07:46:22 %S A279743 0,8,35,106,286,746,1887,4700,11553,28104,67759,162144,385583,912098, %T A279743 2147806,5037496,11773111,27427532,63715400,147634764,341291898, %U A279743 787312776,1812720970,4166252110,9559865376,21903001872,50112866179 %N A279743 Number of 3Xn 0..1 arrays with no element equal to a strict majority of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards. %C A279743 Row 3 of A279741. %H A279743 R. H. Hardin, <a href="/A279743/b279743.txt">Table of n, a(n) for n = 1..210</a> %F A279743 Empirical: a(n) = 6*a(n-1) -13*a(n-2) +10*a(n-3) +10*a(n-4) -30*a(n-5) +21*a(n-6) +2*a(n-7) -14*a(n-8) +10*a(n-9) -7*a(n-10) +6*a(n-11) +6*a(n-12) -2*a(n-13) -a(n-14) -2*a(n-15) -a(n-16) for n>18 %e A279743 Some solutions for n=4 %e A279743 ..0..1..0..1. .0..1..1..1. .0..1..0..1. .0..1..0..0. .0..1..0..1 %e A279743 ..1..0..0..0. .0..1..0..0. .1..0..0..1. .0..1..1..1. .0..0..0..0 %e A279743 ..0..1..1..0. .0..1..1..0. .1..1..0..0. .0..0..0..1. .0..1..1..0 %Y A279743 Cf. A279741. %K A279743 nonn %O A279743 1,2 %A A279743 _R. H. Hardin_, Dec 18 2016