|
%I #4 Dec 10 2012 09:46:04
%S 1,2,2,4,9,4,7,40,40,7,12,155,367,155,12,21,617,3024,3024,617,21,37,
%T 2457,24367,50451,24367,2457,37,65,9785,194128,822483,822483,194128,
%U 9785,65,114,38986,1541546,13221364,26882175,13221364,1541546,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..3 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......3024.....24367....194128...1541546...12227770
%C ...7....155.....3024.....50451....822483..13221364.211771497.3387519403
%C ..12....617....24367....822483..26882175.867644508
%C ..21...2457...194128..13221364.867644508
%C ..37...9785..1541546.211771497
%C ..65..38986.12227770
%C .114.155300
%C .200
%H R. H. Hardin, <a href="/A220313/b220313.txt">Table of n, a(n) for n = 1..59</a>
%e Some solutions for n=3 k=4
%e ..1..0..1..1....1..1..0..0....0..0..1..1....1..1..1..1....1..0..0..1
%e ..1..0..0..0....1..0..1..1....1..0..0..1....0..0..1..0....0..0..1..1
%e ..0..1..0..0....0..0..1..1....0..0..0..1....0..1..1..0....1..1..0..0
%Y Column 1 is A005251(n+2)
%K nonn,tabl
%O 1,2
%A _R. H. Hardin_ Dec 10 2012
|
