|
%I #4 Dec 24 2012 17:34:51
%S 1,2,1,4,8,1,8,37,38,1,16,165,379,176,1,32,749,3687,3299,816,1,64,
%T 3279,30963,61597,27365,3616,1,128,13865,253013,1017676,1004213,
%U 220299,15362,1,256,57374,2042071,16524320,32829580,16172914,1754781,63484,1,512
%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, diagonal and antidiagonal neighbors in a random 0..2 nXk array
%C Table starts
%C .1.....2.......4........8.......16.......32........64......128....256.512
%C .1.....8......37......165......749.....3279.....13865....57374.233955
%C .1....38.....379.....3687....30963...253013...2042071.16390010
%C .1...176....3299....61597..1017676.16524320.265639495
%C .1...816...27365..1004213.32829580
%C .1..3616..220299.16172914
%C .1.15362.1754781
%C .1.63484
%C .1
%H R. H. Hardin, <a href="/A220916/b220916.txt">Table of n, a(n) for n = 1..49</a>
%e Some solutions for n=3 k=4
%e ..0..0..0..1....1..0..1..1....0..0..0..0....1..1..0..1....1..0..0..0
%e ..0..0..1..1....0..0..1..0....1..1..0..0....0..0..1..1....1..1..1..1
%e ..0..0..0..0....0..0..1..1....0..1..0..0....1..1..0..0....0..0..1..0
%Y Column 2 is A220542
%Y Row 1 is A000079(n-1)
%K nonn,tabl
%O 1,2
%A _R. H. Hardin_ Dec 24 2012
|
