|
%I #4 Nov 20 2012 10:15:30
%S 4,4,4,10,4,10,20,13,13,20,35,26,114,26,35,56,57,498,498,57,56,84,116,
%T 2266,3422,2266,116,84,120,231,9146,27967,27967,9146,231,120,165,450,
%U 34529,197308,435960,197308,34529,450,165,220,859,123778,1324860,5544714
%N T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal, vertical, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..3 nXk array
%C Table starts
%C ...4....4......10.......20........35.........56.........84.........120
%C ...4....4......13.......26........57........116........231.........450
%C ..10...13.....114......498......2266.......9146......34529......123778
%C ..20...26.....498.....3422.....27967.....197308....1324860.....8405212
%C ..35...57....2266....27967....435960....5544714...66665715...751202772
%C ..56..116....9146...197308...5544714..124508284.2651269670.53196852108
%C ..84..231...34529..1324860..66665715.2651269670
%C .120..450..123778..8405212.751202772
%C .165..859..426832.51417327
%C .220.1604.1420589
%C .286.2928
%C .364
%H R. H. Hardin, <a href="/A219460/b219460.txt">Table of n, a(n) for n = 1..84</a>
%e Some solutions for n=3 k=4
%e ..1..1..2..3....0..0..3..3....2..1..1..1....1..1..1..1....1..1..1..1
%e ..1..1..2..2....0..0..2..3....0..0..0..1....1..1..0..0....1..1..1..1
%e ..2..2..2..2....0..0..2..3....0..0..0..1....3..2..0..0....2..1..1..1
%Y Column 1 is A000292 for n>1
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_ Nov 20 2012
|
