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 A219690 #6 Jul 23 2025 00:36:50 %S A219690 21,60,655,5726,44816,344926,2709320,21474269,167685059,1273322836, %T A219690 9386203438,67340577300,471427290355,3224592437317,21562151377146, %U A219690 141010883018273,902366368908706,5653483899077449,34695071833947322 %N A219690 Number of 6Xn 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 6Xn array. %C A219690 Row 6 of A219686 %H A219690 R. H. Hardin, <a href="/A219690/b219690.txt">Table of n, a(n) for n = 1..41</a> %e A219690 Some solutions for n=3 %e A219690 ..1..0..0....0..0..0....0..0..0....0..0..0....1..0..0....2..1..1....2..0..0 %e A219690 ..0..0..0....0..0..0....0..0..0....0..0..0....1..0..0....2..1..1....2..0..0 %e A219690 ..0..0..0....0..0..0....1..0..0....1..1..1....1..0..0....2..1..1....2..0..0 %e A219690 ..1..1..2....0..0..0....1..1..0....1..1..1....1..0..0....2..1..1....2..1..1 %e A219690 ..2..2..2....0..0..0....1..0..0....1..1..0....0..0..0....2..2..2....2..1..1 %e A219690 ..2..2..2....2..2..2....2..0..0....1..0..0....0..0..2....2..2..2....2..2..2 %K A219690 nonn %O A219690 1,1 %A A219690 _R. H. Hardin_ Nov 25 2012