A220177 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, vertical and antidiagonal neighbors in a random 0..2 nXk array

2, 2, 2, 8, 16, 8, 16, 48, 48, 16, 24, 256, 404, 256, 24, 64, 856, 4096, 4096, 856, 64, 128, 4096, 31744, 65536, 31744, 4096, 128, 232, 15872, 262144, 1048576, 1048576, 262144, 15872, 232, 512, 65536, 2083808, 16777216, 32395806, 16777216, 2083808, 65536

Offset

1,1

Comments

Table starts

....2......2........8........16.........24.........64.........128........232

....2.....16.......48.......256........856.......4096.......15872......65536

....8.....48......404......4096......31744.....262144.....2083808...16728064

...16....256.....4096.....65536....1048576...16777216...268435456.4294967296

...24....856....31744...1048576...32395806.1073741824.34351349760

...64...4096...262144..16777216.1073741824

..128..15872..2083808.268435456

..232..65536.16728064

..512.259584

.1024

T(n,4)=16^n for n<=8 but not for n=9, so T(n,6) is unlikely to be 64^n for long

Links

R. H. Hardin, Table of n, a(n) for n = 1..60

Example

Some solutions for n=3 k=4
..0..1..1..0....1..0..0..1....0..0..1..1....0..1..0..0....0..1..1..1
..0..1..1..1....1..0..1..1....1..0..1..0....0..0..1..1....1..1..1..1
..0..1..1..0....1..0..1..0....1..1..0..1....1..1..0..1....0..0..0..0

Crossrefs

Sequence in context: A222448 A360309 A220254 * A220805 A298647 A068718

Adjacent sequences: A220174 A220175 A220176 * A220178 A220179 A220180

Keyword

nonn,tabl

Author

R. H. Hardin Dec 06 2012

Status

approved