A217547 T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal, vertical, diagonal or antidiagonal neighbors in a random 0..2 nXk array.
3, 3, 3, 9, 3, 9, 17, 9, 9, 17, 37, 17, 81, 17, 37, 77, 37, 289, 289, 37, 77, 163, 77, 1369, 1401, 1369, 77, 163, 343, 163, 5929, 10213, 10213, 5929, 163, 343, 723, 343, 26569, 64473, 128051, 64473, 26569, 343, 723, 1523, 723, 117649, 431241, 1342855, 1342855
Offset: 1
Examples
Some solutions for n=3 k=4 ..2..0..0..0....0..0..2..2....2..2..0..0....0..0..0..2....1..1..1..2 ..1..0..0..0....0..0..0..1....1..1..0..0....0..0..0..1....0..0..0..0 ..1..1..1..2....0..0..0..1....1..1..1..2....0..0..1..1....0..0..0..0
Links
- R. H. Hardin, Table of n, a(n) for n = 1..144
Comments