|
%I #6 Mar 31 2012 12:35:45
%S 0,0,0,0,0,0,0,2,2,0,0,4,0,4,0,0,2,0,0,2,0,0,0,2,0,2,0,0,0,0,0,0,0,0,
%T 0,0,0,0,0,4,0,4,0,0,0,0,2,2,0,2,2,0,2,2,0,0,4,0,0,4,4,4,0,0,4,0,0,2,
%U 0,4,0,2,2,0,4,0,2,0,0,0,2,4,0,4,4,4,0,4,2,0,0,0,0,0,4,2,2,6,6,2,2,4,0,0,0,0,0,0
%N T(n,k)=Log base 2 of the number of nXk binary arrays with no element equal to the modulo 2 sum of its knight-move neighbors
%C Table starts
%C .0.0.0.0.0.0.0.0.0.0.0.0.0.0.0..0.0.0.0.0.0
%C .0.0.2.4.2.0.0.0.2.4.2.0.0.0.2..4.2.0.0.0
%C .0.2.0.0.2.0.0.2.0.0.2.0.0.2.0..0.2.0.0
%C .0.4.0.0.0.4.0.0.4.4.4.0.0.4.0..0.0.4
%C .0.2.2.0.0.2.4.0.0.2.2.0.0.4.4..4.0
%C .0.0.0.4.2.4.2.4.2.4.0.0.0.0.6.12
%C .0.0.0.0.4.2.4.6.0.0.2.2.2.0.5
%C .0.0.2.0.0.4.6.8.0.0.2.0.0.0
%C .0.2.0.4.0.2.0.0.4.0.6.2.2
%C .0.4.0.4.2.4.0.0.0.0.0.4
%C .0.2.2.4.2.0.2.2.6.0
%C .0.0.0.0.0.0.2.0.2
%C .0.0.0.0.0.0.2.0
%C .0.0.2.4.4.0.0
%C .0.2.0.0.4.6
%C .0.4.0.0.4
%C .0.2.2.0
%C .0.0.0
%C .0.0
%C .0
%H R. H. Hardin, <a href="/A179011/b179011.txt">Table of n, a(n) for n = 1..220</a>
%e All solutions for 5X5
%e ..1..0..1..0..1
%e ..0..1..1..1..0
%e ..1..1..1..1..1
%e ..0..1..1..1..0
%e ..1..0..1..0..1
%K nonn,tabl
%O 1,8
%A _R. H. Hardin_ Jan 04 2011
|
