%I #4 Jan 18 2013 17:27:36
%S 1,2,1,4,7,1,7,33,21,1,12,119,228,65,1,21,457,1733,1561,200,1,37,1710,
%T 14297,24485,10648,616,1,65,6466,111042,420022,345755,72625,1897,1,
%U 114,24433,874106,6665056,12253352,4882030,495329,5842,1,200,92196,6765307
%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 and antidiagonal neighbors in a random 0..3 nXk array
%C Table starts
%C .1......2.........4...........7...........12............21............37
%C .1......7........33.........119..........457..........1710..........6466
%C .1.....21.......228........1733........14297........111042........874106
%C .1.....65......1561.......24485.......420022.......6665056.....107190767
%C .1....200.....10648......345755.....12253352.....395300442...12890161742
%C .1....616.....72625.....4882030....356799776...23379869304.1542965772979
%C .1...1897....495329....68933905..10385011060.1381866811158
%C .1...5842...3378333...973340015.302233979821
%C .1..17991..23041525.13743460075
%C .1..55405.157152036
%C .1.170625
%C .1
%H R. H. Hardin, <a href="/A221499/b221499.txt">Table of n, a(n) for n = 1..83</a>
%e Some solutions for n=3 k=4
%e ..0..0..1..1....0..0..0..0....1..1..1..1....0..0..0..0....1..1..1..0
%e ..1..1..0..1....1..0..0..1....1..0..1..0....0..0..1..1....0..1..1..1
%e ..0..0..1..1....1..0..0..1....1..0..0..1....1..1..1..1....0..0..1..1
%Y Column 2 is A218836
%Y Column 3 is A221030
%Y Column 4 is A221031
%Y Row 1 is A005251(n+2)
%Y Row 2 is A221036
%K nonn,tabl
%O 1,2
%A _R. H. Hardin_ Jan 18 2013