A220032 T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal or diagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..1 nXk array.
2, 2, 3, 3, 4, 4, 4, 6, 6, 5, 5, 9, 10, 8, 6, 6, 12, 19, 15, 10, 7, 7, 15, 30, 34, 21, 12, 8, 8, 18, 42, 61, 55, 28, 14, 9, 9, 21, 55, 95, 111, 83, 36, 16, 10, 10, 24, 69, 137, 192, 187, 119, 45, 18, 11, 11, 27, 84, 187, 302, 358, 297, 164, 55, 20, 12, 12, 30, 100, 246, 442, 613, 626
Offset: 1
Examples
Some solutions for n=3 k=4 ..0..0..0..0....1..0..0..0....1..0..0..0....0..0..0..0....1..0..0..0 ..0..0..0..0....1..1..0..0....1..0..0..0....1..1..0..0....1..1..1..0 ..1..1..0..0....1..1..0..0....1..0..0..0....1..1..1..1....1..1..1..1
Links
- R. H. Hardin, Table of n, a(n) for n = 1..198
Comments