A219595 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.
3, 3, 3, 6, 7, 6, 10, 18, 21, 10, 15, 34, 84, 46, 15, 21, 55, 233, 264, 87, 21, 28, 81, 550, 1114, 705, 151, 28, 36, 112, 1188, 4152, 4350, 1739, 247, 36, 45, 148, 2415, 14793, 26006, 16117, 4129, 386, 45, 55, 189, 4684, 51122, 156964, 164075, 60252, 9518, 581
Offset: 1
Examples
Some solutions for n=3 k=4 ..1..1..0..0....0..0..0..0....0..0..0..0....1..1..0..0....2..1..0..0 ..1..1..1..0....1..0..0..0....1..0..0..0....1..1..1..0....2..1..1..0 ..1..1..0..0....1..2..2..1....1..2..0..0....2..2..0..0....2..1..1..1
Links
- R. H. Hardin, Table of n, a(n) for n = 1..97
Comments