A222935 T(n,k)=Sum of neighbor maps: number of nXk binary arrays indicating the locations of corresponding elements equal to the sum mod 4 of their horizontal and antidiagonal neighbors in a random 0..3 nXk array.
2, 2, 4, 8, 16, 8, 16, 48, 64, 16, 24, 256, 512, 232, 32, 64, 1024, 4000, 4096, 1024, 64, 128, 4096, 32760, 63488, 32768, 4096, 128, 232, 15820, 262104, 1047664, 1048352, 262144, 16224, 256, 512, 65536, 2097152, 16776992, 33553920, 16777216, 2097152
Offset: 1
Examples
Some solutions for n=3 k=4 ..0..0..1..1....0..1..1..1....1..1..1..0....0..1..0..0....1..1..1..1 ..0..0..1..1....0..0..1..0....0..1..0..0....0..1..1..1....1..1..0..1 ..0..0..1..0....1..1..0..0....0..1..0..1....0..1..1..0....0..0..1..0
Links
- R. H. Hardin, Table of n, a(n) for n = 1..70
Comments