|
%I #4 Dec 25 2012 06:34:36
%S 1,2,1,4,10,1,7,44,35,1,12,163,324,132,1,21,626,2874,2456,497,1,37,
%T 2351,23519,48021,18606,1881,1,65,8950,189300,807720,768087,141464,
%U 7102,1,114,33895,1518325,13318834,26141052,12279716,1073265,26812,1,200,128696
%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, diagonal and antidiagonal neighbors in a random 0..2 nXk array
%C Table starts
%C .1.....2.......4........7.......12.......21........37.......65....114.200
%C .1....10......44......163......626.....2351......8950....33895.128696
%C .1....35.....324.....2874....23519...189300...1518325.12108564
%C .1...132....2456....48021...807720.13318834.216461890
%C .1...497...18606...768087.26141052
%C .1..1881..141464.12279716
%C .1..7102.1073265
%C .1.26812
%C .1
%H R. H. Hardin, <a href="/A220922/b220922.txt">Table of n, a(n) for n = 1..49</a>
%e Some solutions for n=3 k=4
%e ..1..1..1..1....1..1..1..1....0..0..0..1....1..0..0..0....1..0..1..0
%e ..0..0..0..0....0..0..0..1....0..0..0..0....1..1..0..0....0..1..1..1
%e ..0..1..0..0....1..1..0..1....0..0..0..0....1..1..1..0....0..1..1..1
%Y Column 2 is A220255
%Y Row 1 is A005251(n+2)
%K nonn,tabl
%O 1,2
%A _R. H. Hardin_ Dec 25 2012
|
