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 A231973 #6 Jul 23 2025 06:45:56 %S A231973 81,550,4489,43983,417316,3844551,35366809,328433132,3052452001, %T A231973 28290095075,262170624676,2431326125085,22547805893209, %U A231973 209069115157116,1938539544264801,17975390997067603,166679573715753604 %N A231973 Number of (n+1)X(4+1) 0..1 arrays with no element having a strict majority of its horizontal and vertical neighbors equal to one. %C A231973 Column 4 of A231977 %H A231973 R. H. Hardin, <a href="/A231973/b231973.txt">Table of n, a(n) for n = 1..210</a> %F A231973 Empirical: a(n) = 7*a(n-1) +148*a(n-3) +344*a(n-4) +673*a(n-5) +337*a(n-6) +11361*a(n-7) +48985*a(n-8) -97191*a(n-9) -358946*a(n-10) +417305*a(n-11) +1757105*a(n-12) -2002936*a(n-13) -7478980*a(n-14) -818162*a(n-15) +5202627*a(n-16) +2279142*a(n-17) -18922108*a(n-18) -31042348*a(n-19) -55043465*a(n-20) +23805696*a(n-21) -10999792*a(n-22) +52136816*a(n-23) +30760744*a(n-24) +21670317*a(n-25) +137708184*a(n-26) +27375080*a(n-27) +134395920*a(n-28) -103979476*a(n-29) +49936800*a(n-30) -43951872*a(n-31) -5680896*a(n-32) +5000768*a(n-33) -11970048*a(n-34) +4762496*a(n-35) +3064320*a(n-36) +9770624*a(n-37) +9022464*a(n-38) -7157760*a(n-39) +4641792*a(n-40) -3973120*a(n-41) +204800*a(n-42) +663552*a(n-43) -86016*a(n-44) -205824*a(n-45) +73728*a(n-46) -32768*a(n-48) +16384*a(n-49) %e A231973 Some solutions for n=2 %e A231973 ..1..0..0..0..1....0..0..0..0..1....0..0..0..1..0....0..0..0..0..1 %e A231973 ..0..0..1..0..0....1..0..0..0..0....1..0..0..0..0....1..0..0..0..0 %e A231973 ..0..0..1..0..0....0..0..0..1..0....1..0..0..0..0....0..0..1..1..0 %K A231973 nonn %O A231973 1,1 %A A231973 _R. H. Hardin_, Nov 16 2013