A220328 T(n,k)=Equals two maps: number of nXk binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..1 nXk array.
1, 1, 1, 2, 4, 1, 4, 16, 12, 1, 7, 48, 92, 37, 1, 12, 174, 572, 508, 114, 1, 21, 658, 4062, 6657, 2788, 351, 1, 37, 2482, 29467, 92093, 76627, 15316, 1081, 1, 65, 9229, 213225, 1335202, 2065264, 876714, 84196, 3329, 1, 114, 33982, 1540686, 18836493, 59893608
Offset: 1
Examples
Some solutions for n=3 k=4 ..0..0..0..0....0..0..0..0....0..1..0..0....0..0..0..0....0..1..1..1 ..0..0..0..0....1..1..0..0....1..0..1..0....1..1..1..1....0..0..1..1 ..1..0..1..0....1..1..0..0....1..0..1..0....0..1..1..0....0..0..0..0
Links
- R. H. Hardin, Table of n, a(n) for n = 1..70
Comments