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 A231758 #6 Jul 23 2025 06:40:36 %S A231758 33,136,660,3213,14989,70927,338352,1603633,7596720,36066272, %T A231758 171140301,811651995,3850637109,18269376384,86668158745,411153474416, %U A231758 1950577525332,9253691650061,43899995716425,208265361505983,988028267125504 %N A231758 Number of (n+1)X(2+1) 0..1 arrays with no element having a strict majority of its horizontal, diagonal and antidiagonal neighbors equal to one. %C A231758 Column 2 of A231764 %H A231758 R. H. Hardin, <a href="/A231758/b231758.txt">Table of n, a(n) for n = 1..210</a> %F A231758 Empirical: a(n) = 3*a(n-1) +47*a(n-3) -25*a(n-4) +21*a(n-5) -403*a(n-6) +110*a(n-7) +40*a(n-8) +1601*a(n-9) -348*a(n-10) -520*a(n-11) -2656*a(n-12) +792*a(n-13) +288*a(n-14) +2480*a(n-15) -544*a(n-16) +128*a(n-17) -1600*a(n-18) +128*a(n-19) +512*a(n-21) %e A231758 Some solutions for n=6 %e A231758 ..0..0..0....1..0..0....1..0..0....0..0..0....0..0..1....1..0..0....0..0..0 %e A231758 ..1..0..1....1..1..0....0..1..1....1..0..0....0..0..0....1..0..0....1..0..1 %e A231758 ..0..1..1....0..0..1....0..0..0....1..0..1....1..1..1....1..1..0....1..0..0 %e A231758 ..0..0..0....0..0..1....1..0..0....0..0..0....0..0..1....1..0..0....0..0..0 %e A231758 ..0..0..0....1..0..0....1..0..0....1..0..0....0..0..0....1..0..0....0..1..0 %e A231758 ..1..1..0....0..1..1....0..0..0....0..1..1....1..0..1....0..1..1....0..0..0 %e A231758 ..0..0..1....0..0..0....1..1..0....0..0..1....0..1..0....1..0..0....1..0..0 %K A231758 nonn %O A231758 1,1 %A A231758 _R. H. Hardin_, Nov 13 2013