%I #4 Dec 31 2012 06:38:11
%S 1,2,1,4,8,1,8,37,32,1,16,172,323,128,1,32,771,3322,2735,512,1,64,
%T 3392,29939,58710,22683,2048,1,128,14569,254900,1016831,989020,185563,
%U 8192,1,256,61210,2080204,16715282,33166449,16261308,1503659,32768,1,512,252491
%N T(n,k)=Equals one maps: number of nXk binary arrays indicating the locations of corresponding elements equal to exactly one of their horizontal and antidiagonal neighbors in a random 0..3 nXk array
%C Table starts
%C .1.....2.......4........8.......16.......32......64......128....256.512
%C .1.....8......37......172......771.....3392...14569....61210.252491
%C .1....32.....323.....3322....29939...254900.2080204.16745866
%C .1...128....2735....58710..1016831.16715282
%C .1...512...22683...989020.33166449
%C .1..2048..185563.16261308
%C .1..8192.1503659
%C .1.32768
%C .1
%H R. H. Hardin, <a href="/A221062/b221062.txt">Table of n, a(n) for n = 1..48</a>
%e Some solutions for n=3 k=4
%e ..0..0..1..1....1..0..1..1....1..1..1..1....0..0..1..0....1..0..0..0
%e ..0..0..0..1....1..0..0..0....0..1..0..0....0..0..1..0....1..1..1..1
%e ..0..1..0..1....0..0..0..0....0..1..1..1....1..1..1..1....0..1..0..1
%Y Column 2 is A004171(n-1)
%Y Row 1 is A000079(n-1)
%K nonn,tabl
%O 1,2
%A _R. H. Hardin_ Dec 31 2012