|
%I #4 Mar 09 2013 10:57:39
%S 2,2,4,8,16,8,16,48,64,16,24,256,512,232,32,64,1024,4000,4096,1024,64,
%T 128,4096,32760,63488,32768,4096,128,232,15820,262104,1047664,1048352,
%U 262144,16224,256,512,65536,2097152,16776992,33553920,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 4 of their horizontal and antidiagonal neighbors in a random 0..3 nXk array
%C Table starts
%C ....2.......2.........8.........16..........24..........64.........128
%C ....4......16........48........256........1024........4096.......15820
%C ....8......64.......512.......4000.......32760......262104.....2097152
%C ...16.....232......4096......63488.....1047664....16776992...268435456
%C ...32....1024.....32768....1048352....33553920..1073741824.34358569712
%C ...64....4096....262144...16777216..1073741824.68719413208
%C ..128...16224...2097152..268435456.34359738368
%C ..256...65536..16777216.4294962688
%C ..512..262144.134217728
%C .1024.1047680
%C .2048
%H R. H. Hardin, <a href="/A222935/b222935.txt">Table of n, a(n) for n = 1..70</a>
%e Some solutions for n=3 k=4
%e ..0..0..1..1....0..1..1..1....1..1..1..0....0..1..0..0....1..1..1..1
%e ..0..0..1..1....0..0..1..0....0..1..0..0....0..1..1..1....1..1..0..1
%e ..0..0..1..0....1..1..0..0....0..1..0..1....0..1..1..0....0..0..1..0
%Y Column 1 is A000079
%Y Column 2 is A222381
%Y Column 3 is A001018 except for a(2)
%Y Row 1 is A220172
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_ Mar 09 2013
| 