A219686 T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal, vertical or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 nXk array.
3, 3, 3, 6, 4, 6, 10, 8, 9, 10, 15, 14, 31, 19, 15, 21, 22, 87, 99, 35, 21, 28, 32, 208, 427, 269, 60, 28, 36, 44, 452, 1531, 1688, 655, 98, 36, 45, 58, 922, 5031, 8964, 5726, 1506, 154, 45, 55, 74, 1799, 15763, 44736, 44816, 18486, 3356, 234, 55, 66, 92, 3394, 47784
Offset: 1
Examples
Some solutions for n=3 k=4 ..1..1..1..1....0..0..0..0....1..1..0..0....1..1..0..0....1..1..1..0 ..1..1..1..1....0..0..0..0....1..1..0..0....1..0..0..0....1..1..0..0 ..2..1..1..1....1..1..0..0....2..2..0..0....2..0..0..0....2..2..0..0
Links
- R. H. Hardin, Table of n, a(n) for n = 1..127
Comments