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 A279465 #4 Dec 12 2016 15:19:57 %S A279465 15,658,26670,1079792,41706415,1529974962,54755104784,1926654903560, %T A279465 66854006751350,2293311539588776,77940818083281196, %U A279465 2628632829003297482,88079138411703964163,2934932008298081335876,97326119686256417416192 %N A279465 Number of nX7 0..1 arrays with no element equal to a strict majority of its horizontal, vertical and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards. %C A279465 Column 7 of A279466. %H A279465 R. H. Hardin, <a href="/A279465/b279465.txt">Table of n, a(n) for n = 1..103</a> %e A279465 Some solutions for n=3 %e A279465 ..0..0..0..1..0..1..0. .0..0..1..0..1..0..1. .0..0..0..1..0..1..0 %e A279465 ..1..1..1..1..0..0..0. .1..0..1..1..1..0..1. .1..1..0..1..0..1..1 %e A279465 ..0..0..0..1..1..1..1. .0..1..0..1..0..1..0. .1..1..0..0..1..0..0 %Y A279465 Cf. A279466. %K A279465 nonn %O A279465 1,1 %A A279465 _R. H. Hardin_, Dec 12 2016