|
%I #4 Nov 28 2012 16:54:58
%S 3,3,3,6,6,6,10,15,16,10,15,28,62,33,15,21,45,165,169,61,21,28,66,377,
%T 648,414,106,28,36,91,795,2179,2237,987,176,36,45,120,1588,7049,11395,
%U 7689,2359,281,45,55,153,3039,22017,57848,62341,27340,5569,433,55,66,190
%N T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal, vertical or diagonal 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....6.....15......28.......45........66........91.......120.......153
%C ..6...16.....62.....165......377.......795......1588......3039......5612
%C .10...33....169.....648.....2179......7049.....22017.....65842....188487
%C .15...61....414....2237....11395.....57848....283334...1322739...5913303
%C .21..106....987....7689....62341....510090...3967857..29319493.208512645
%C .28..176...2359...27340...358480...4734774..59065976.707079160
%C .36..281...5569...97483..2042977..43171729.864699568
%C .45..433..12737..336348.11133454.376434884
%C .55..646..27982.1107489.57524941
%C .66..936..59028.3485470
%C .78.1321.119947
%H R. H. Hardin, <a href="/A219816/b219816.txt">Table of n, a(n) for n = 1..111</a>
%e Some solutions for n=3 k=4
%e ..1..1..1..1....1..0..0..0....1..0..0..0....0..0..0..0....1..1..1..1
%e ..2..1..1..1....1..1..0..0....2..1..0..0....0..0..0..0....1..1..0..0
%e ..2..2..2..2....1..1..1..1....2..2..1..0....2..2..1..1....2..2..0..0
%Y Column 1 and Row 1 are A000217 for n>1
%Y Row 2 is A000384 for n>1
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_ Nov 28 2012
|
