A220805 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 vertical neighbors in a random 0..3 nXk array.
2, 2, 2, 8, 16, 8, 16, 48, 48, 16, 24, 256, 512, 256, 24, 64, 928, 4096, 4096, 928, 64, 128, 4096, 30766, 62648, 30766, 4096, 128, 232, 15820, 262144, 1048576, 1048576, 262144, 15820, 232, 512, 65536, 2097152, 16777216, 33358976, 16777216, 2097152, 65536
Offset: 1
Examples
Some solutions for n=3 k=4 ..0..1..0..0....1..1..1..0....0..1..0..1....1..0..1..0....1..1..0..1 ..1..0..0..1....1..0..0..0....0..1..0..0....1..0..1..1....1..0..1..1 ..1..0..0..0....1..0..1..1....0..1..1..1....1..0..1..0....1..0..1..0
Links
- R. H. Hardin, Table of n, a(n) for n = 1..60
Crossrefs
Column 1 is A220172
Comments