A219883 T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 nXk array.
3, 3, 6, 6, 7, 10, 10, 11, 21, 15, 15, 17, 47, 46, 21, 21, 24, 129, 146, 87, 28, 28, 32, 292, 621, 410, 151, 36, 36, 41, 600, 2190, 2645, 1069, 247, 45, 45, 51, 1158, 6965, 14536, 10350, 2701, 386, 55, 55, 62, 2148, 21035, 74998, 89795, 40239, 6645, 581, 66, 66, 74
Offset: 1
Examples
Some solutions for n=3 k=4 ..1..1..0..0....2..2..0..0....1..0..0..0....1..0..0..0....0..0..0..0 ..1..1..0..1....2..2..0..0....0..0..0..0....1..0..0..0....0..0..0..0 ..1..1..0..0....2..2..0..0....0..0..0..2....2..0..2..0....0..2..0..2
Links
- R. H. Hardin, Table of n, a(n) for n = 1..111
Comments