A219078 T(n,k)=Hilltop maps: number of nXk binary arrays indicating the locations of corresponding elements not exceeded by any horizontal, diagonal or antidiagonal neighbor in a random 0..1 nXk array.
1, 3, 1, 5, 11, 1, 9, 47, 41, 1, 17, 165, 337, 149, 1, 31, 625, 2321, 2469, 547, 1, 57, 2435, 17537, 32945, 18499, 2007, 1, 105, 9367, 134809, 494713, 477309, 137251, 7361, 1, 193, 35901, 1023441, 7561349, 14228041, 6879341, 1019123, 27001, 1, 355, 137865
Offset: 1
Examples
Some solutions for n=3 k=4 ..1..1..0..0....1..1..1..1....1..0..0..1....1..1..1..1....0..0..1..1 ..0..0..1..0....1..0..0..1....1..1..0..0....1..1..1..0....1..1..1..0 ..0..1..0..0....1..1..0..1....1..0..1..1....0..1..0..1....0..0..0..1
Links
- R. H. Hardin, Table of n, a(n) for n = 1..197
Comments