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 A200713 #7 Jul 22 2025 15:54:15 %S A200713 8,36,36,154,540,154,638,7370,7370,638,2583,95567,317656,95567,2583, %T A200713 10283,1196837,12904303,12904303,1196837,10283,40437,14599041, %U A200713 501622631,1630978608,501622631,14599041,40437,157577,174544948,18836416881 %N A200713 T(n,k)=Number of nXk 0..7 arrays with every row and column running average nondecreasing rightwards and downwards. %C A200713 Table starts %C A200713 .......8..........36............154..............638..............2583 %C A200713 ......36.........540...........7370............95567...........1196837 %C A200713 .....154........7370.........317656.........12904303.........501622631 %C A200713 .....638.......95567.......12904303.......1630978608......195675787426 %C A200713 ....2583.....1196837......501622631.....195675787426....71952946981858 %C A200713 ...10283....14599041....18836416881...22525604271509.25239894694049776 %C A200713 ...40437...174544948...688892422045.2512851095363929 %C A200713 ..157577..2054226643.24679562321720 %C A200713 ..609826.23879098633 %C A200713 .2347039 %H A200713 R. H. Hardin, <a href="/A200713/b200713.txt">Table of n, a(n) for n = 1..59</a> %e A200713 Some solutions for n=3 k=3 %e A200713 ..0..0..3....0..0..3....0..4..2....0..0..2....0..0..4....0..2..6....0..0..3 %e A200713 ..0..2..3....1..4..3....2..6..5....0..4..7....2..3..6....0..6..6....2..2..6 %e A200713 ..5..6..7....1..5..4....1..7..6....0..5..5....1..7..5....0..7..7....1..5..6 %K A200713 nonn,tabl %O A200713 1,1 %A A200713 _R. H. Hardin_ Nov 20 2011