Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #4 Dec 07 2012 12:31:58
%S 1,2,2,4,6,4,7,23,23,7,12,75,179,75,12,21,241,1220,1220,241,21,37,777,
%T 8293,16465,8293,777,37,65,2512,56222,218677,218677,56222,2512,65,114,
%U 8132,381710,2902395,5674816,2902395,381710,8132,114,200,26335,2590727
%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 king-move neighbors in a random 0..1 nXk array
%C Table starts
%C ...1.....2.......4........7........12........21.........37........65......114
%C ...2.....6......23.......75.......241.......777.......2512......8132....26335
%C ...4....23.....179.....1220......8293.....56222.....381710...2590727.17589144
%C ...7....75....1220....16465....218677...2902395...38572432.512629581
%C ..12...241....8293...218677...5674816.147455678.3839631745
%C ..21...777...56222..2902395.147455678
%C ..37..2512..381710.38572432
%C ..65..8132.2590727
%C .114.26335
%C .200
%H R. H. Hardin, <a href="/A220217/b220217.txt">Table of n, a(n) for n = 1..60</a>
%e Some solutions for n=3 k=4
%e ..1..0..1..1....0..0..0..1....1..0..0..0....1..0..0..1....0..1..0..0
%e ..0..0..1..0....0..1..1..1....1..1..0..0....0..1..1..1....1..1..1..1
%e ..0..0..1..1....1..1..1..1....0..1..0..1....0..0..1..1....1..1..0..1
%Y Column 1 is A005251(n+2)
%K nonn,tabl
%O 1,2
%A _R. H. Hardin_ Dec 07 2012