|
%I #4 Feb 18 2013 05:36:05
%S 2,2,4,8,16,8,16,48,64,16,24,248,512,232,32,64,1024,3968,3968,1024,64,
%T 128,3968,32768,63488,32768,4096,128,232,15872,262144,1048576,1048320,
%U 261376,16224,256,512,65536,2093824,16776896,33546240,16777216,2097152
%N 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 and antidiagonal neighbors in a random 0..2 nXk array
%C Table starts
%C ....2.......2.........8.........16..........24..........64.........128
%C ....4......16........48........248........1024........3968.......15872
%C ....8......64.......512.......3968.......32768......262144.....2093824
%C ...16.....232......3968......63488.....1048576....16776896...268369920
%C ...32....1024.....32768....1048320....33546240..1073741712.34359738368
%C ...64....4096....261376...16777216..1073741824.68719469568
%C ..128...16224...2097152..268435072.34359738368
%C ..256...65536..16773120.4294961152
%C ..512..262144.134217728
%C .1024.1047680
%C .2048
%H R. H. Hardin, <a href="/A222386/b222386.txt">Table of n, a(n) for n = 1..70</a>
%e Some solutions for n=3 k=4
%e ..0..1..1..0....0..1..0..0....0..0..1..0....0..0..0..1....1..1..0..1
%e ..1..1..0..1....0..1..0..1....0..0..1..0....1..0..0..0....0..1..0..1
%e ..1..1..1..0....0..1..0..1....0..1..0..0....0..1..1..0....0..0..1..1
%Y Column 1 is A000079
%Y Row 1 is A220172
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_ Feb 18 2013
| 