|
%I #4 Dec 12 2012 19:26:23
%S 1,2,2,4,9,4,7,40,40,7,12,155,367,155,12,21,617,3014,3014,617,21,37,
%T 2457,24345,50267,24345,2457,37,65,9785,193978,820235,820235,193978,
%U 9785,65,114,38986,1540532,13190432,26836471,13190432,1540532,38986,114,200
%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, vertical and antidiagonal neighbors in a random 0..2 nXk array
%C Table starts
%C ...1......2........4.........7........12........21..........37.........65
%C ...2......9.......40.......155.......617......2457........9785......38986
%C ...4.....40......367......3014.....24345....193978.....1540532...12219682
%C ...7....155.....3014.....50267....820235..13190432...211323937.3380651011
%C ..12....617....24345....820235..26836471.866350793.27812177431
%C ..21...2457...193978..13190432.866350793
%C ..37...9785..1540532.211323937
%C ..65..38986.12219682
%C .114.155300
%C .200
%H R. H. Hardin, <a href="/A220369/b220369.txt">Table of n, a(n) for n = 1..60</a>
%e Some solutions for n=3 k=4
%e ..1..1..0..1....1..0..0..1....1..0..0..1....0..0..0..1....0..0..0..0
%e ..1..0..0..1....0..1..0..0....1..0..1..1....0..0..0..0....1..1..0..1
%e ..0..1..0..0....1..1..1..1....0..1..0..0....0..0..1..1....1..0..0..1
%Y Column 1 is A005251(n+2)
%Y Column 2 is A220309
%K nonn,tabl
%O 1,2
%A _R. H. Hardin_ Dec 12 2012
|
