|
%I #5 Jan 20 2013 11:48:36
%S 1,2,2,4,8,4,8,40,40,8,16,180,418,180,16,32,772,3760,3760,772,32,64,
%T 3264,31416,64324,31416,3264,64,128,13634,256736,1043774,1043774,
%U 256736,13634,128,256,56456,2075520,16758008,33535224,16758008,2075520,56456,256,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 king-move neighbors in a random 0..3 nXk array
%C Table starts
%C ...1......2........4.........8.........16.........32........64........128
%C ...2......8.......40.......180........772.......3264.....13634......56456
%C ...4.....40......418......3760......31416.....256736...2075520...16690688
%C ...8....180.....3760.....64324....1043774...16758008.268358624.4294659968
%C ..16....772....31416...1043774...33535224.1073664992
%C ..32...3264...256736..16758008.1073664992
%C ..64..13634..2075520.268358624
%C .128..56456.16690688
%C .256.232150
%C .512
%H R. H. Hardin, <a href="/A221590/b221590.txt">Table of n, a(n) for n = 1..59</a>
%e Some solutions for n=3 k=4
%e ..1..0..0..0....1..0..1..1....0..1..0..0....0..1..1..0....1..1..1..0
%e ..1..1..1..0....1..0..0..0....1..0..1..0....0..0..1..1....1..0..0..0
%e ..1..0..1..1....1..1..1..0....1..0..1..0....1..0..0..1....1..0..0..1
%Y Column 1 is A000079(n-1)
%K nonn,tabl
%O 1,2
%A _R. H. Hardin_ Jan 20 2013
|
