Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #4 Nov 13 2012 08:52:42
%S 3,3,3,6,7,6,10,23,23,10,15,53,146,53,15,21,103,644,644,103,21,28,182,
%T 2399,5853,2399,182,28,36,302,8024,43013,43013,8024,302,36,45,478,
%U 24670,276278,602498,276278,24670,478,45,55,728,70595,1613256,7275277,7275277
%N T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal or vertical neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..2 nXk array
%C Table starts
%C ..3....3.......6........10..........15............21............28
%C ..3....7......23........53.........103...........182...........302
%C ..6...23.....146.......644........2399..........8024.........24670
%C .10...53.....644......5853.......43013........276278.......1613256
%C .15..103....2399.....43013......602498.......7275277......80593130
%C .21..182....8024....276278.....7275277.....165134835....3500147133
%C .28..302...24670...1613256....80593130....3500147133..144424701184
%C .36..478...70595...8712423...831309835...69563364248.5595306138684
%C .45..728..189703..43862661..7991092857.1285723371646
%C .55.1073..482428.207505133.71939079266
%C .66.1537.1168768.928829599
%C .78.2147.2712689
%H R. H. Hardin, <a href="/A219173/b219173.txt">Table of n, a(n) for n = 1..111</a>
%e Some solutions for n=3 k=4
%e ..0..0..1..2....0..0..2..2....0..0..1..2....0..0..2..2....0..0..1..0
%e ..0..1..1..0....0..0..2..2....0..0..0..1....0..1..2..2....0..0..0..0
%e ..2..1..0..0....0..1..1..2....2..0..0..0....1..1..1..2....0..2..2..0
%Y Column 1 is (n^2+n)/2 for n>1
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_ Nov 13 2012