A217457 T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal and vertical neighbors in a random 0..2 nXk array.
3, 3, 3, 9, 15, 9, 17, 69, 69, 17, 37, 253, 613, 253, 37, 77, 1049, 4361, 4361, 1049, 77, 163, 4205, 35067, 60821, 35067, 4205, 163, 343, 16887, 271863, 939819, 939819, 271863, 16887, 343, 723, 68015, 2122623, 14031423, 28176327, 14031423, 2122623
Offset: 1
Examples
Some solutions for n=3 k=4 ..0..0..0..0....0..0..0..1....1..1..1..1....2..1..0..0....1..0..0..0 ..0..2..0..2....1..0..1..1....1..2..2..1....1..1..1..0....0..0..0..0 ..2..0..0..0....2..1..1..2....1..1..1..1....2..1..2..2....0..0..2..0
Links
- R. H. Hardin, Table of n, a(n) for n = 1..111
Comments