A218592 T(n,k)=Hilltop maps: number of nXk binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or antidiagonal neighbor in a random 0..2 nXk array.
1, 3, 1, 7, 13, 1, 13, 57, 49, 1, 25, 225, 449, 191, 1, 49, 895, 3565, 3567, 737, 1, 97, 3565, 28325, 56629, 28305, 2849, 1, 191, 14189, 225647, 898763, 900213, 224643, 11011, 1, 375, 56489, 1798967, 14313773, 28543403, 14309253, 1782855, 42557, 1, 737, 224891
Offset: 1
Examples
Some solutions for n=3 k=4 ..0..1..1..0....0..0..1..0....0..1..0..1....0..0..0..0....1..1..1..0 ..1..0..0..1....1..0..0..1....1..1..1..1....1..0..0..1....0..0..0..0 ..1..0..1..1....0..0..0..0....0..1..1..0....0..0..0..0....1..0..0..1
Links
- R. H. Hardin, Table of n, a(n) for n = 1..178
Comments