A219128 T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random 0..2 nXk array.
3, 3, 9, 9, 15, 27, 17, 87, 69, 81, 37, 205, 787, 253, 243, 77, 899, 3495, 6981, 1049, 729, 163, 2521, 27993, 42231, 63183, 4205, 2187, 343, 9709, 154447, 717585, 607115, 571149, 16887, 6561, 723, 29747, 1080809, 5940377, 20168447, 8325319, 5167013
Offset: 1
Examples
Some solutions for n=3 k=4 ..2..2..1..1....1..0..2..2....2..0..2..1....0..0..1..1....0..0..1..1 ..1..0..1..0....0..0..1..2....0..0..1..1....0..0..1..2....1..0..1..1 ..1..0..0..0....0..0..1..1....2..0..2..1....0..0..1..2....1..1..1..2
Links
- R. H. Hardin, Table of n, a(n) for n = 1..111
Comments