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 A232139 #6 Jul 23 2025 06:54:19 %S A232139 44,728,10956,169692,2616952,40399768,623543776,9624373808, %T A232139 148550587192,2292857494812,35389922134468,546238342870352, %U A232139 8431109896279836,130132963416612180,2008583492065392256,31002196055330559468 %N A232139 Number of (2+1)X(n+1) 0..2 arrays with no element equal to a strict majority of its horizontal and antidiagonal neighbors, with values 0..2 introduced in row major order. %C A232139 Row 2 of A232137 %H A232139 R. H. Hardin, <a href="/A232139/b232139.txt">Table of n, a(n) for n = 1..210</a> %F A232139 Empirical: a(n) = 15*a(n-1) +16*a(n-2) -163*a(n-3) +305*a(n-4) +116*a(n-5) -2324*a(n-6) +1718*a(n-7) -5922*a(n-8) +14296*a(n-9) +18892*a(n-10) -15292*a(n-11) -21000*a(n-12) -12320*a(n-13) -17184*a(n-14) +11072*a(n-15) +5120*a(n-17) %e A232139 Some solutions for n=3 %e A232139 ..0..1..0..1....0..1..1..2....0..1..2..2....0..1..2..2....0..1..0..2 %e A232139 ..1..2..1..2....0..0..2..2....2..1..0..2....0..1..0..2....1..0..0..2 %e A232139 ..1..0..1..2....2..0..0..1....2..2..0..1....1..2..0..1....2..1..2..0 %K A232139 nonn %O A232139 1,1 %A A232139 _R. H. Hardin_, Nov 19 2013