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 A219130 #8 Jul 23 2025 00:15:10 %S A219130 27,69,787,3495,27993,154447,1080809,6526907,43241983,270431585, %T A219130 1753511935,11117046371,71479973835,455588313465,2919712813815, %U A219130 18647687495411,119353646989167,762902760386741,4880484858150293 %N A219130 Number of 3Xn arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random 0..2 3Xn array. %C A219130 Row 3 of A219128 %H A219130 R. H. Hardin, <a href="/A219130/b219130.txt">Table of n, a(n) for n = 1..28</a> %e A219130 Some solutions for n=3 %e A219130 ..1..0..0....1..0..2....2..0..0....1..1..1....0..0..1....2..1..1....2..1..2 %e A219130 ..1..0..2....0..0..0....0..0..2....2..1..1....2..0..2....1..0..2....2..0..1 %e A219130 ..2..0..0....1..0..0....2..0..0....1..1..1....1..0..0....0..0..2....2..0..0 %K A219130 nonn %O A219130 1,1 %A A219130 _R. H. Hardin_ Nov 12 2012