A221290 T(n,k) = Equals two maps: number of n X k binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..3 n X k array.
1, 1, 1, 2, 4, 1, 4, 16, 12, 1, 7, 52, 92, 37, 1, 12, 200, 673, 556, 114, 1, 21, 792, 5912, 9107, 3332, 351, 1, 37, 3080, 48298, 172904, 123958, 19996, 1081, 1, 65, 12164, 396846, 2890017, 4983598, 1686304, 119972, 3329, 1, 114, 47827, 3240527, 49684593
Offset: 1
Examples
Some solutions for n=3, k=4 ..0..0..1..0....0..0..0..0....0..1..0..0....0..0..0..1....0..0..0..1 ..0..0..1..0....0..1..0..0....1..0..1..0....0..0..0..0....1..0..0..0 ..0..1..0..0....1..0..1..0....1..1..1..0....1..1..0..0....1..1..0..0
Links
- R. H. Hardin, Table of n, a(n) for n = 1..70
Comments