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 A219131 #8 Jul 23 2025 00:15:16 %S A219131 81,253,6981,42231,717585,5940377,80892559,781927421,9569579009, %T A219131 99563194119,1158353288989,12479863472959,141758613941473, %U A219131 1552733071485933,17438598795150161,192510267581544599 %N A219131 Number of 4Xn arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random 0..2 4Xn array. %C A219131 Row 4 of A219128 %H A219131 R. H. Hardin, <a href="/A219131/b219131.txt">Table of n, a(n) for n = 1..24</a> %e A219131 Some solutions for n=3 %e A219131 ..1..1..2....0..0..0....1..0..2....2..0..0....0..0..0....0..0..2....2..0..0 %e A219131 ..1..0..2....1..0..2....2..0..0....0..0..0....2..0..1....0..0..0....0..0..0 %e A219131 ..0..0..0....0..0..0....0..0..1....2..0..0....1..0..2....0..0..1....1..0..0 %e A219131 ..2..0..2....1..0..0....0..0..0....2..0..1....0..0..2....2..0..2....0..0..2 %K A219131 nonn %O A219131 1,1 %A A219131 _R. H. Hardin_ Nov 12 2012