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 A200931 #7 Jul 22 2025 16:00:33 %S A200931 21,70,86,466,11620,46664,19639,1992563,19428961,27064328,185609499, %T A200931 6071753195,27077249191,10857445569,1382034290296,15507764357015, %U A200931 22979292470431,166552455290745,5855288096822543,26804755495077100 %N A200931 Number of nX2 0..6 arrays with every row and column running average nondecreasing rightwards and downwards, and the number of instances of each value within one of each other. %C A200931 Column 2 of A200935 %H A200931 R. H. Hardin, <a href="/A200931/b200931.txt">Table of n, a(n) for n = 1..25</a> %e A200931 Some solutions for n=3 %e A200931 ..0..1....0..3....0..4....0..2....0..2....0..2....0..1....0..3....0..1....1..2 %e A200931 ..2..5....1..4....1..5....5..6....1..3....1..5....3..6....2..5....3..4....5..6 %e A200931 ..3..4....2..5....3..6....3..4....5..6....4..6....4..5....4..6....2..6....3..4 %K A200931 nonn %O A200931 1,1 %A A200931 _R. H. Hardin_ Nov 24 2011