login
T(n,k)=Majority value maps: number of nXk binary arrays indicating the locations of corresponding elements equal to at least half of their king-move neighbors in a random 0..2 nXk array
4

%I #4 Dec 07 2012 05:26:01

%S 1,2,2,4,6,4,7,25,25,7,12,88,249,88,12,21,297,2010,2010,297,21,37,

%T 1009,15892,34265,15892,1009,37,65,3464,124104,568355,568355,124104,

%U 3464,65,114,11908,966863,9188616,19432051,9188616,966863,11908,114,200,40900

%N T(n,k)=Majority value maps: number of nXk binary arrays indicating the locations of corresponding elements equal to at least half of their king-move neighbors in a random 0..2 nXk array

%C Table starts

%C ...1.....2......4.......7.......12......21........37......65...114.200

%C ...2.....6.....25......88......297....1009......3464...11908.40900

%C ...4....25....249....2010....15892..124104....966863.7523192

%C ...7....88...2010...34265...568355.9188616.147348422

%C ..12...297..15892..568355.19432051

%C ..21..1009.124104.9188616

%C ..37..3464.966863

%C ..65.11908

%C .114

%H R. H. Hardin, <a href="/A220194/b220194.txt">Table of n, a(n) for n = 1..49</a>

%e Some solutions for n=3 k=4

%e ..1..1..1..1....1..1..1..0....1..0..0..0....1..0..1..1....0..1..1..1

%e ..0..0..0..0....1..1..1..1....0..0..0..0....0..1..1..1....0..0..0..1

%e ..1..0..0..1....0..0..0..1....0..1..1..1....1..1..1..1....0..1..0..0

%Y Column 1 is A005251(n+2)

%K nonn,tabl

%O 1,2

%A _R. H. Hardin_ Dec 07 2012