A221666 T(n,k)=Sum of neighbor maps: number of nXk binary arrays indicating the locations of corresponding elements equal to the sum mod 3 of their horizontal, diagonal and antidiagonal neighbors in a random 0..2 nXk array.
2, 2, 4, 8, 12, 8, 16, 64, 48, 16, 24, 256, 512, 256, 32, 64, 992, 3772, 3772, 856, 64, 128, 4096, 31744, 63200, 32768, 4096, 128, 232, 16384, 262144, 1048576, 1048576, 262144, 15872, 256, 512, 65344, 2097152, 16777216, 33421056, 16777216, 2097152, 65344
Offset: 1
Examples
Some solutions for n=3 k=4 ..1..0..0..0....0..1..0..0....1..1..0..0....1..0..0..0....0..1..1..0 ..0..1..0..0....1..0..1..1....0..0..0..1....1..1..0..1....0..1..0..1 ..0..1..1..1....1..1..1..0....1..0..0..1....0..0..0..1....1..0..0..1
Links
- R. H. Hardin, Table of n, a(n) for n = 1..59
Comments