login
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 nonincreasing columns, 0..2 nXk array
13

%I #4 Nov 23 2012 13:48:38

%S 3,3,3,6,7,6,10,18,21,10,15,34,84,46,15,21,55,233,264,87,21,28,81,550,

%T 1114,705,151,28,36,112,1188,4152,4350,1739,247,36,45,148,2415,14793,

%U 26006,16117,4129,386,45,55,189,4684,51122,156964,164075,60252,9518,581

%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 nonincreasing columns, 0..2 nXk array

%C Table starts

%C ..3....3.....6......10.......15........21........28........36.........45

%C ..3....7....18......34.......55........81.......112.......148........189

%C ..6...21....84.....233......550......1188......2415......4684.......8746

%C .10...46...264....1114.....4152.....14793.....51122....170728.....550156

%C .15...87...705....4350....26006....156964....939006...5466749...30837420

%C .21..151..1739...16117...164075...1767430..18945258.197089634.1981970463

%C .28..247..4129...60252..1093496..21435360.415752625

%C .36..386..9518..226309..7362866.259297241

%C .45..581.21271..831045.47724022

%C .55..847.46019.2932198

%C .66.1201.96412

%C .78.1662

%H R. H. Hardin, <a href="/A219595/b219595.txt">Table of n, a(n) for n = 1..97</a>

%e Some solutions for n=3 k=4

%e ..1..1..0..0....0..0..0..0....0..0..0..0....1..1..0..0....2..1..0..0

%e ..1..1..1..0....1..0..0..0....1..0..0..0....1..1..1..0....2..1..1..0

%e ..1..1..0..0....1..2..2..1....1..2..0..0....2..2..0..0....2..1..1..1

%Y Row and Column 1 are A000217 for n>1

%Y Row 2 is A000566 for n>1

%K nonn,tabl

%O 1,1

%A _R. H. Hardin_ Nov 23 2012