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 A219132 #8 Jul 23 2025 00:15:24 %S A219132 243,1049,63183,607115,20168447,285332189,7257445621,124234358895, %T A219132 2783396055591,52032195606049,1099686106378363,21401861684236265, %U A219132 440426781367948209,8729796620293368601,177478732361408469929 %N A219132 Number of 5Xn arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random 0..2 5Xn array. %C A219132 Row 5 of A219128 %H A219132 R. H. Hardin, <a href="/A219132/b219132.txt">Table of n, a(n) for n = 1..25</a> %e A219132 Some solutions for n=3 %e A219132 ..1..1..1....2..0..0....1..1..2....0..0..1....0..0..0....0..0..0....0..0..2 %e A219132 ..2..1..2....2..0..0....1..0..1....2..0..2....2..0..0....1..0..1....1..0..0 %e A219132 ..1..0..2....2..0..1....0..0..0....0..0..1....1..0..0....1..0..0....2..0..1 %e A219132 ..0..0..1....2..0..0....2..0..2....2..0..1....2..0..0....2..0..2....1..0..0 %e A219132 ..0..0..0....1..0..0....2..1..1....2..1..2....0..0..1....1..1..1....0..0..1 %K A219132 nonn %O A219132 1,1 %A A219132 _R. H. Hardin_ Nov 12 2012