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 A232141 #6 Jul 23 2025 06:54:34 %S A232141 2448,298912,33162868,3795674252,433383414596,49550984711452, %T A232141 5664993176292288,647700628194870872,74053929808545025552, %U A232141 8466867333806114553152,968048831724850940855792 %N A232141 Number of (4+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 A232141 Row 4 of A232137 %H A232141 R. H. Hardin, <a href="/A232141/b232141.txt">Table of n, a(n) for n = 1..210</a> %e A232141 Some solutions for n=2 %e A232141 ..0..1..0....0..1..0....0..1..0....0..1..0....0..1..0....0..1..0....0..1..0 %e A232141 ..0..2..0....0..2..2....2..2..1....0..2..0....0..0..2....0..0..2....0..1..0 %e A232141 ..2..1..2....0..0..1....1..0..1....1..0..2....2..0..2....1..0..1....0..2..1 %e A232141 ..1..2..2....1..0..0....0..2..0....1..2..0....2..1..2....2..0..1....0..2..1 %e A232141 ..1..0..1....1..2..0....0..2..1....1..1..0....1..2..1....0..2..1....0..1..0 %K A232141 nonn %O A232141 1,1 %A A232141 _R. H. Hardin_, Nov 19 2013