A217982 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..1 nXk array.
2, 2, 2, 4, 2, 4, 6, 4, 4, 6, 10, 6, 16, 6, 10, 16, 10, 36, 36, 10, 16, 26, 16, 100, 98, 100, 16, 26, 42, 26, 256, 362, 362, 256, 26, 42, 68, 42, 676, 1180, 1942, 1180, 676, 42, 68, 110, 68, 1764, 4046, 8872, 8872, 4046, 1764, 68, 110, 178, 110, 4624, 13594, 43258, 54504
Offset: 1
Examples
Some solutions for n=3 k=4 ..0..0..0..0....0..0..1..1....0..0..0..1....1..1..1..1....1..1..0..0 ..0..0..0..0....0..0..1..1....0..0..0..1....0..0..0..1....1..1..0..0 ..1..1..1..1....0..0..1..1....1..1..1..1....0..0..0..1....1..1..1..1
Links
- R. H. Hardin, Table of n, a(n) for n = 1..287
- J. Gebel, Integer points on Mordell curves [Cached copy, after the original web site tnt.math.se.tmu.ac.jp was shut down in 2017]
Comments