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 A231392 #6 Jul 23 2025 06:27:12 %S A231392 33,90,311,1096,4085,15732,62039,245850,980361,3915982,15667453, %T A231392 62726276,251241863,1006595336,4033439213,16163623302,64777551551, %U A231392 259612134798,1040482017255,4170131147952,16713541804781,66986842603436 %N A231392 Number of (n+1)X(4+1) 0..2 arrays with no element unequal to a strict majority of its horizontal, diagonal and antidiagonal neighbors, with values 0..2 introduced in row major order. %C A231392 Column 4 of A231396 %H A231392 R. H. Hardin, <a href="/A231392/b231392.txt">Table of n, a(n) for n = 1..210</a> %F A231392 Empirical: a(n) = 6*a(n-1) -2*a(n-2) -28*a(n-3) -5*a(n-4) +74*a(n-5) +67*a(n-6) -29*a(n-7) -322*a(n-8) +13*a(n-9) +804*a(n-10) -816*a(n-11) +389*a(n-12) -306*a(n-13) -903*a(n-14) +1630*a(n-15) -942*a(n-16) +736*a(n-17) -1009*a(n-18) +279*a(n-19) +497*a(n-20) -83*a(n-21) +177*a(n-22) -192*a(n-23) +50*a(n-24) -96*a(n-25) -12*a(n-26) +12*a(n-27) +12*a(n-28) for n>31 %e A231392 Some solutions for n=5 %e A231392 ..0..0..0..1..1....0..0..0..1..1....0..0..0..1..1....0..1..1..1..1 %e A231392 ..0..0..0..1..1....1..1..1..0..0....1..1..1..0..0....0..0..1..1..1 %e A231392 ..1..1..1..0..0....1..1..0..0..0....1..1..0..0..0....0..0..1..1..1 %e A231392 ..1..1..0..0..0....0..0..1..1..1....1..1..1..0..0....0..0..0..1..1 %e A231392 ..2..2..2..0..0....0..0..1..1..1....1..1..1..0..0....0..0..0..0..0 %e A231392 ..2..2..2..2..2....1..1..0..0..0....1..1..1..1..0....0..0..0..0..0 %K A231392 nonn %O A231392 1,1 %A A231392 _R. H. Hardin_, Nov 08 2013