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 A231768 #6 Jul 23 2025 06:41:36 %S A231768 81,3213,40000,493695,8231161,143424652,2217939025,34022084475, %T A231768 540272041024,8624998783485,135974699750761,2140797614249280, %U A231768 33837345338388601,535135681749071815,8451720496022804100 %N A231768 Number of (4+1)X(n+1) 0..1 arrays with no element having a strict majority of its horizontal, diagonal and antidiagonal neighbors equal to one. %C A231768 Row 4 of A231764 %H A231768 R. H. Hardin, <a href="/A231768/b231768.txt">Table of n, a(n) for n = 1..210</a> %e A231768 Some solutions for n=3 %e A231768 ..0..1..0..0....1..0..0..0....1..0..0..0....0..0..0..0....0..0..1..1 %e A231768 ..0..0..0..1....0..0..0..1....0..0..1..0....1..1..1..1....0..0..0..0 %e A231768 ..0..0..1..0....0..1..0..1....1..0..0..1....0..0..0..1....1..1..0..1 %e A231768 ..0..0..0..1....0..0..1..0....0..0..0..0....0..0..0..0....0..0..0..0 %e A231768 ..0..0..0..1....0..0..0..1....1..1..1..1....1..0..1..0....1..0..0..1 %K A231768 nonn %O A231768 1,1 %A A231768 _R. H. Hardin_, Nov 13 2013