|
%I #7 Dec 03 2012 19:28:41
%S 1,2,2,4,6,4,7,19,19,7,12,65,134,65,12,21,222,878,878,222,21,37,776,
%T 5609,10179,5609,776,37,65,2682,36011,122999,122999,36011,2682,65,114,
%U 9310,231343,1493178,2812956,1493178,231343,9310,114,200,32288,1483999
%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 vertical neighbors in a random 0..1 nXk array
%C Table starts
%C ...1......2.......4.........7.........12.........21.........37..........65
%C ...2......6......19........65........222........776.......2682........9310
%C ...4.....19.....134.......878.......5609......36011.....231343.....1483999
%C ...7.....65.....878.....10179.....122999....1493178...18090893...219096964
%C ..12....222....5609....122999....2812956...64074980.1459489751.33247715499
%C ..21....776...36011...1493178...64074980.2742089334
%C ..37...2682..231343..18090893.1459489751
%C ..65...9310.1483999.219096964
%C .114..32288.9515200
%C .200.112036
%C .351
%H R. H. Hardin, <a href="/A220070/b220070.txt">Table of n, a(n) for n = 1..71</a>
%e Some solutions for n=3 k=4
%e ..1..1..1..0....1..1..1..1....1..1..1..1....1..0..0..0....1..0..0..0
%e ..0..1..1..0....0..0..1..1....0..1..1..1....0..1..1..0....0..1..0..0
%e ..1..0..0..1....1..1..0..1....1..1..0..0....0..0..0..1....1..1..0..1
%Y Column 1 is A005251(n+2)
%K nonn,tabl
%O 1,2
%A _R. H. Hardin_ Dec 03 2012
|
