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 A268246 #4 Jan 29 2016 07:24:34 %S A268246 2,9,4,64,81,6,615,4096,576,9,7536,378225,216000,3969,12,112476, %T A268246 56791296,197555340,10941048,25281,16,1981512,12650850576, %U A268246 371713931400,98956027822,519718464,155236,20,40265487,3926389806144,1257212773492866 %N A268246 T(n,k)=Number of nXk 0..k arrays with every repeated value in every row greater than or equal to, and every column greater than, the previous repeated value. %C A268246 Table starts %C A268246 ..2......9..........64............615.............7536................112476 %C A268246 ..4.....81........4096.........378225.........56791296...........12650850576 %C A268246 ..6....576......216000......197555340.....371713931400......1257212773492866 %C A268246 ..9...3969....10941048....98956027822.2335306173137957.120138605995104637373 %C A268246 .12..25281...519718464.46876747497685 %C A268246 .16.155236.23689358848 %C A268246 .20.915849 %C A268246 .25 %H A268246 R. H. Hardin, <a href="/A268246/b268246.txt">Table of n, a(n) for n = 1..40</a> %F A268246 Empirical for column k: %F A268246 k=1: a(n) = 2*a(n-1) -2*a(n-3) +a(n-4) %F A268246 k=2: [order 15] %F A268246 k=3: [order 40] %e A268246 Some solutions for n=2 k=4 %e A268246 ..1..1..0..1....0..0..2..0....0..1..2..0....0..2..2..2....1..1..2..3 %e A268246 ..1..0..2..2....3..4..4..3....2..3..1..2....0..3..0..1....1..0..4..2 %Y A268246 Column 1 is A002620(n+2). %Y A268246 Column 2 is A267961. %Y A268246 Column 3 is A267971. %Y A268246 Row 1 is A268104. %Y A268246 Row 2 is A268105. %K A268246 nonn,tabl %O A268246 1,1 %A A268246 _R. H. Hardin_, Jan 29 2016