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 A280157 #4 Dec 27 2016 09:19:21 %S A280157 2,18,94,424,1854,7628,30874,123312,488256,1920790,7513678,29249892, %T A280157 113386708,437908264,1685639238,6469357240,24762845248,94557090250, %U A280157 360277506538,1369975634630,5199885300498,19703519987286,74545164231536 %N A280157 Number of nX4 0..1 arrays with no element unequal 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 A280157 Column 4 of A280161. %H A280157 R. H. Hardin, <a href="/A280157/b280157.txt">Table of n, a(n) for n = 1..210</a> %F A280157 Empirical: a(n) = 8*a(n-1) -8*a(n-2) -74*a(n-3) +144*a(n-4) +268*a(n-5) -631*a(n-6) -714*a(n-7) +1344*a(n-8) +2362*a(n-9) -2134*a(n-10) -6068*a(n-11) +2745*a(n-12) +9240*a(n-13) +321*a(n-14) -10644*a(n-15) -5878*a(n-16) +9474*a(n-17) +4820*a(n-18) -1796*a(n-19) -2276*a(n-20) -1436*a(n-21) +58*a(n-22) +800*a(n-23) +187*a(n-24) -46*a(n-25) -43*a(n-26) -28*a(n-27) +a(n-28) +6*a(n-29) -a(n-30) for n>36 %e A280157 Some solutions for n=4 %e A280157 ..0..0..1..0. .0..0..0..0. .0..0..0..0. .0..0..0..0. .0..0..0..1 %e A280157 ..0..1..1..0. .0..0..0..1. .0..0..0..1. .0..1..0..0. .0..0..1..1 %e A280157 ..1..1..1..0. .1..1..1..1. .0..0..0..1. .0..0..0..1. .1..0..1..1 %e A280157 ..1..1..0..0. .1..1..0..0. .0..0..0..1. .0..0..1..1. .0..0..0..0 %Y A280157 Cf. A280161. %K A280157 nonn %O A280157 1,1 %A A280157 _R. H. Hardin_, Dec 27 2016