A218426 T(n,k)=Hilltop maps: number of nXk binary arrays indicating the locations of corresponding elements not exceeded by any horizontal, vertical or antidiagonal neighbor in a random 0..1 nXk array.
1, 3, 3, 5, 13, 5, 9, 49, 49, 9, 17, 191, 357, 191, 17, 31, 737, 2725, 2725, 737, 31, 57, 2849, 20793, 41515, 20793, 2849, 57, 105, 11011, 158429, 629659, 629659, 158429, 11011, 105, 193, 42557, 1207525, 9539915, 19003811, 9539915, 1207525, 42557, 193
Offset: 1
Examples
Some solutions for n=3 k=4 ..1..0..1..1....0..1..0..1....1..1..1..0....1..1..0..1....1..0..0..1 ..0..1..0..1....0..0..0..0....0..0..1..0....0..0..1..0....0..1..0..0 ..1..1..1..1....1..1..0..1....1..1..0..1....1..1..0..1....0..1..1..1
Links
- R. H. Hardin, Table of n, a(n) for n = 1..263
Crossrefs
Column 1 is A000213(n+1)
Comments