%I #4 Dec 13 2012 10:00:49
%S 1,2,1,4,7,1,7,25,21,1,12,79,136,65,1,21,278,757,753,200,1,37,966,
%T 5114,7462,4160,616,1,65,3362,33247,96772,73066,22989,1897,1,114,
%U 11642,211944,1191846,1829169,715412,127037,5842,1,200,40375,1358599,14300020
%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..1 nXk array
%C Table starts
%C .1......2.........4...........7............12.............21..............37
%C .1......7........25..........79...........278............966............3362
%C .1.....21.......136.........757..........5114..........33247..........211944
%C .1.....65.......753........7462.........96772........1191846........14300020
%C .1....200......4160.......73066.......1829169.......42415575.......953142266
%C .1....616.....22989......715412......34521416.....1509240923.....63512364783
%C .1...1897....127037.....7003040.....651568437....53692543412...4230913273170
%C .1...5842....702009....68557435...12297040231..1910141303899.281832304026762
%C .1..17991...3879313...671141189..232084431547.67952729355483
%C .1..55405..21437148..6570141318.4380156648582
%C .1.170625.118462034.64318370539
%C .1.525456.654623158
%H R. H. Hardin, <a href="/A220386/b220386.txt">Table of n, a(n) for n = 1..110</a>
%e Some solutions for n=3 k=4
%e ..0..0..1..0....1..1..1..0....1..1..1..1....1..1..0..0....1..1..1..1
%e ..0..1..1..0....0..1..0..0....0..1..1..1....1..1..0..0....0..1..1..1
%e ..0..1..0..0....1..0..0..1....1..1..0..1....1..1..0..0....0..0..0..0
%Y Column 2 is A218836
%Y Row 1 is A005251(n+2)
%K nonn,tabl
%O 1,2
%A _R. H. Hardin_ Dec 13 2012
|