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 A219691 #5 Jul 23 2025 00:36:57 %S A219691 28,98,1506,18486,220182,2706117,35011623,461414270,5979059010, %T A219691 75005582670 %N A219691 Number of 7Xn arrays of the minimum value of corresponding elements and their horizontal, vertical or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 7Xn array. %C A219691 Row 7 of A219686 %e A219691 Some solutions for n=3 %e A219691 ..1..0..0....1..0..0....1..0..0....1..0..0....1..0..0....0..0..0....1..0..0 %e A219691 ..1..0..0....1..0..0....1..0..0....1..0..0....1..0..0....0..0..0....1..0..0 %e A219691 ..0..0..0....1..1..1....1..0..0....1..0..0....0..0..0....0..0..0....2..0..0 %e A219691 ..0..0..0....1..0..0....1..1..1....1..0..0....0..0..0....1..0..0....2..1..1 %e A219691 ..0..0..0....0..0..0....2..1..1....0..0..0....0..0..0....1..0..0....2..1..1 %e A219691 ..0..0..0....0..0..0....2..1..1....0..0..1....1..1..2....2..0..0....2..1..1 %e A219691 ..0..0..2....1..1..1....2..2..2....1..1..2....2..2..2....2..1..1....2..2..2 %K A219691 nonn %O A219691 1,1 %A A219691 _R. H. Hardin_ Nov 25 2012