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 A279167 #4 Dec 07 2016 08:15:17 %S A279167 15,284,7709,203226,5159514,121098448,2708250146,58954576326, %T A279167 1248383818884,25842455526113,526028318802380,10553193022979559, %U A279167 209056148689381340,4097404879908777416,79569078719501719249 %N A279167 Number of nX7 0..1 arrays with no element equal to a strict majority of its king-move neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards. %C A279167 Column 7 of A279168. %H A279167 R. H. Hardin, <a href="/A279167/b279167.txt">Table of n, a(n) for n = 1..55</a> %e A279167 Some solutions for n=3 %e A279167 ..0..1..1..0..1..1..0. .0..1..0..0..1..0..1. .0..1..0..0..0..1..1 %e A279167 ..1..1..0..0..0..1..0. .1..0..1..0..1..0..1. .1..0..1..1..1..0..0 %e A279167 ..0..0..1..1..1..0..1. .1..0..1..1..1..0..1. .0..1..1..0..0..1..1 %Y A279167 Cf. A279168. %K A279167 nonn %O A279167 1,1 %A A279167 _R. H. Hardin_, Dec 07 2016