A221446 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..1 nXk array.
1, 3, 1, 5, 9, 1, 9, 33, 31, 1, 17, 117, 221, 105, 1, 31, 429, 1465, 1473, 355, 1, 57, 1577, 10593, 18393, 9829, 1201, 1, 105, 5785, 76055, 260557, 230845, 65569, 4063, 1, 193, 21217, 543081, 3669101, 6415089, 2897357, 437437, 13745, 1, 355, 77825, 3883061
Offset: 1
Examples
Some solutions for n=3 k=4 ..1..0..1..1....0..1..1..1....1..1..1..0....1..1..0..1....1..0..0..0 ..1..0..1..1....0..1..1..0....0..0..1..0....1..1..1..1....1..1..1..1 ..0..1..0..1....1..1..1..0....1..0..0..1....1..1..1..0....1..1..1..0
Links
- R. H. Hardin, Table of n, a(n) for n = 1..217
Crossrefs
Row 1 is A000213(n+1)
Comments