%I #4 Dec 28 2012 10:56:00
%S 1,2,1,4,10,1,7,44,35,1,12,168,324,132,1,21,642,2899,2456,497,1,37,
%T 2463,23895,48800,18606,1881,1,65,9454,193052,826251,781249,141464,
%U 7102,1,114,36363,1550909,13696660,26731299,12552490,1073265,26812,1,200,139880
%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 horizontal, diagonal and antidiagonal neighbors in a random 0..3 nXk array
%C Table starts
%C .1.....2.......4........7.......12.......21........37.......65....114.200
%C .1....10......44......168......642.....2463......9454....36363.139880
%C .1....35.....324.....2899....23895...193052...1550909.12392103
%C .1...132....2456....48800...826251.13696660.222785284
%C .1...497...18606...781249.26731299
%C .1..1881..141464.12552490
%C .1..7102.1073265
%C .1.26812
%C .1
%H R. H. Hardin, <a href="/A220993/b220993.txt">Table of n, a(n) for n = 1..49</a>
%e Some solutions for n=3 k=4
%e ..0..0..0..0....0..1..1..1....1..0..1..0....0..1..1..1....0..1..1..0
%e ..0..0..0..1....1..1..0..1....0..0..1..0....1..1..1..0....1..1..0..1
%e ..1..1..1..0....0..1..1..0....0..0..0..1....0..1..0..0....0..1..1..0
%Y Column 2 is A220255
%Y Column 3 is A220920
%Y Row 1 is A005251(n+2)
%K nonn,tabl
%O 1,2
%A _R. H. Hardin_ Dec 28 2012
|