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 A223663 #6 Feb 11 2024 20:03:47 %S A223663 4,16,16,50,256,50,130,3060,3060,130,296,29922,141046,29922,296,610, %T A223663 252912,5285887,5285887,252912,610,1163,1912914,169756788,761845474, %U A223663 169756788,1912914,1163,2083,13254601,4836834467,93974096640,93974096640 %N A223663 T(n,k) = Number of n X k 0..3 arrays with row sums unimodal and column sums inverted unimodal. %C A223663 Table starts %C A223663 ....4........16............50..............130...............296 %C A223663 ...16.......256..........3060............29922............252912 %C A223663 ...50......3060........141046..........5285887.........169756788 %C A223663 ..130.....29922.......5285887........761845474.......93974096640 %C A223663 ..296....252912.....169756788......93974096640....44626165058452 %C A223663 ..610...1912914....4836834467...10253839694278.18744540823704239 %C A223663 .1163..13254601..125226945708.1013084819998517 %C A223663 .2083..85563043.2997363216275 %C A223663 .3544.521069404 %C A223663 .5776 %H A223663 R. H. Hardin, <a href="/A223663/b223663.txt">Table of n, a(n) for n = 1..59</a> %e A223663 Some solutions for n=3 k=4 %e A223663 ..2..0..0..2....2..2..0..0....2..2..0..2....0..0..1..2....2..0..0..0 %e A223663 ..0..2..3..0....2..2..3..0....2..0..1..0....3..0..1..2....0..2..1..2 %e A223663 ..2..0..2..3....3..2..0..0....0..1..0..2....3..2..1..1....1..0..1..0 %K A223663 nonn,tabl %O A223663 1,1 %A A223663 _R. H. Hardin_, Mar 25 2013