login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

T(n,k)=Half the number of nXk binary arrays with no element equal to a strict majority of its knight-move neighbors
6

%I #5 Mar 31 2012 12:35:51

%S 1,2,2,4,8,4,8,8,8,8,16,8,46,8,16,32,8,69,69,8,32,64,8,227,156,227,8,

%T 64,128,32,794,451,451,794,32,128,256,128,2701,2595,2145,2595,2701,

%U 128,256,512,288,9816,12150,17689,17689,12150,9816,288,512,1024,648,34649,58407

%N T(n,k)=Half the number of nXk binary arrays with no element equal to a strict majority of its knight-move neighbors

%C Same solutions for no element unequal to a strict majority of its neighbors, via xor with a 0101... checkerboard pattern

%C Table starts

%C ...1...2......4.......8......16.......32.......64......128.......256......512

%C ...2...8......8.......8.......8........8.......32......128.......288......648

%C ...4...8.....46......69.....227......794.....2701.....9816.....34649...120536

%C ...8...8.....69.....156.....451.....2595....12150....58407....280852..1405171

%C ..16...8....227.....451....2145....17689...115241...776298...5449079.38642644

%C ..32...8....794....2595...17689...233505..2051732.19639561.204306894

%C ..64..32...2701...12150..115241..2051732.25401329

%C .128.128...9816...58407..776298.19639561

%C .256.288..34649..280852.5449079

%C .512.648.120536.1405171

%H R. H. Hardin, <a href="/A183397/b183397.txt">Table of n, a(n) for n = 1..97</a>

%e Some solutions with a(1,1)=0 for 6X5

%e ..0..1..1..0..0....0..0..0..1..0....0..0..0..0..0....0..1..1..1..0

%e ..0..1..1..0..0....1..0..1..1..0....0..1..0..0..0....0..0..1..1..1

%e ..0..1..1..0..1....0..0..1..1..0....1..1..1..1..1....0..0..0..0..1

%e ..0..1..0..0..0....1..0..1..1..0....0..1..0..1..1....1..1..0..0..1

%e ..1..1..1..0..1....0..0..1..1..0....0..0..0..0..0....1..1..0..0..1

%e ..0..1..0..1..1....1..0..1..1..0....1..1..1..1..0....1..1..0..0..1

%K nonn,tabl

%O 1,2

%A _R. H. Hardin_ Jan 04 2011