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 A219598 #6 Jul 23 2025 00:34:17 %S A219598 15,87,705,4350,26006,156964,939006,5466749,30837420,168947111, %T A219598 901097968,4680202369,23651533225,116192356397,554663937245, %U A219598 2572846819549,11600123422679,50863765123285,217051630988778,902189285684499 %N A219598 Number of 5Xn arrays of the minimum value of corresponding elements and their horizontal or vertical neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 5Xn array. %C A219598 Row 5 of A219595 %H A219598 R. H. Hardin, <a href="/A219598/b219598.txt">Table of n, a(n) for n = 1..37</a> %e A219598 Some solutions for n=3 %e A219598 ..0..0..0....1..0..0....1..0..0....0..0..0....0..0..0....0..0..0....1..1..1 %e A219598 ..0..0..0....1..1..0....1..1..0....0..0..0....1..0..0....1..0..0....1..1..0 %e A219598 ..0..0..0....1..0..0....1..1..1....1..0..0....1..2..0....1..1..2....1..0..0 %e A219598 ..0..0..0....2..1..0....1..1..1....1..1..0....2..2..2....1..0..0....1..0..0 %e A219598 ..1..0..1....2..1..1....2..2..1....2..1..1....2..2..2....0..0..0....1..1..0 %K A219598 nonn %O A219598 1,1 %A A219598 _R. H. Hardin_ Nov 23 2012