|
%I #4 Dec 01 2012 17:59:20
%S 4,4,10,10,23,20,20,64,76,35,35,196,368,208,56,56,459,2070,2030,519,
%T 84,84,918,8523,21512,10791,1212,120,120,1660,30558,173951,224794,
%U 53712,2670,165,165,2802,100761,1301292,3773045,2225355,248881,5574,220,220
%N T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal or diagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..3 nXk array
%C Table starts
%C ...4.....4......10........20.........35.........56........84.........120
%C ..10....23......64.......196........459........918......1660........2802
%C ..20....76.....368......2070.......8523......30558....100761......313108
%C ..35...208....2030.....21512.....173951....1301292...9073439....59354249
%C ..56...519...10791....224794....3773045...59049705.871084602.12058384658
%C ..84..1212...53712...2225355...78522914.2574187888
%C .120..2670..248881..20434119.1523159314
%C .165..5574.1078041.175334420
%C .220.11076.4392080
%C .286.21043
%C .364
%H R. H. Hardin, <a href="/A219939/b219939.txt">Table of n, a(n) for n = 1..71</a>
%e Some solutions for n=3 k=4
%e ..2..2..0..1....1..1..1..1....2..2..0..1....2..0..0..0....2..1..1..2
%e ..2..2..0..0....2..2..0..1....3..2..0..0....1..1..0..0....3..1..1..1
%e ..3..3..2..2....3..2..0..0....3..3..2..2....1..1..0..0....3..2..1..1
%Y Column 1 is A000292(n+1)
%Y Row 1 is A000292 for n>1
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_ Dec 01 2012
|
