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 A281768 #4 Jan 29 2017 12:43:04 %S A281768 0,20,90,560,2808,13968,68362,323280,1529974,7114300,32915192, %T A281768 151142772,689726508,3133687480,14169310798,63838844556,286639424578, %U A281768 1283124275056,5728711606322,25513799290264,113382456085042,502859346935932 %N A281768 Number of 4Xn 0..1 arrays with no element unequal to a strict majority of its horizontal, diagonal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards. %C A281768 Row 4 of A281765. %H A281768 R. H. Hardin, <a href="/A281768/b281768.txt">Table of n, a(n) for n = 1..210</a> %e A281768 Some solutions for n=4 %e A281768 ..0..0..0..0. .0..1..0..1. .0..0..1..1. .0..0..0..0. .0..0..1..0 %e A281768 ..0..1..1..1. .0..0..1..0. .0..1..0..1. .1..1..0..0. .0..1..1..1 %e A281768 ..1..1..1..1. .0..0..0..1. .0..0..1..0. .1..1..0..0. .0..0..1..1 %e A281768 ..1..1..1..1. .0..0..1..1. .0..0..0..1. .1..1..0..0. .0..0..0..1 %Y A281768 Cf. A281765. %K A281768 nonn %O A281768 1,2 %A A281768 _R. H. Hardin_, Jan 29 2017