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 A267933 #4 Jan 22 2016 10:10:16 %S A267933 4,16,16,60,256,60,222,3600,3600,222,804,49284,178068,49284,804,2872, %T A267933 646416,8459154,8459154,646416,2872,10132,8248384,376812420, %U A267933 1376175262,376812420,8248384,10132,35383,102657424,16109362560,205495778969 %N A267933 T(n,k)=Number of nXk 0..3 arrays with every repeated value in every row and column greater than the previous repeated value. %C A267933 Table starts %C A267933 ......4..........16.............60..............222...............804 %C A267933 .....16.........256...........3600............49284............646416 %C A267933 .....60........3600.........178068..........8459154.........376812420 %C A267933 ....222.......49284........8459154.......1376175262......205495778969 %C A267933 ....804......646416......376812420.....205495778969...100687082932722 %C A267933 ...2872.....8248384....16109362560...29057389299071.46100277695598540 %C A267933 ..10132...102657424...663451196118.3909876972823819 %C A267933 ..35383..1251956689.26507885328672 %C A267933 .122480.15001350400 %C A267933 .420752 %H A267933 R. H. Hardin, <a href="/A267933/b267933.txt">Table of n, a(n) for n = 1..60</a> %F A267933 Empirical for column k: %F A267933 k=1: [linear recurrence of order 8] %F A267933 k=2: [order 21] %F A267933 k=3: [order 81] %e A267933 Some solutions for n=3 k=4 %e A267933 ..0..2..0..0....2..2..3..2....2..0..0..2....2..2..1..3....0..2..3..0 %e A267933 ..2..1..2..3....2..1..3..1....0..2..0..3....2..1..1..2....2..3..2..1 %e A267933 ..0..0..2..3....0..0..1..3....0..0..3..2....0..2..0..3....0..0..3..3 %K A267933 nonn,tabl %O A267933 1,1 %A A267933 _R. H. Hardin_, Jan 22 2016