|
%I #5 Mar 31 2012 12:36:56
%S 0,0,0,0,4,0,0,4,4,0,0,16,28,16,0,0,36,64,64,36,0,0,100,372,676,372,
%T 100,0,0,256,1444,4624,4624,1444,256,0,0,676,6528,40000,72852,40000,
%U 6528,676,0,0,1764,28900,311364,996004,996004,311364,28900,1764,0,0,4624,127412
%N T(n,k)=Number of nXk binary arrays with every element neighboring horizontally or vertically both a 0 and a 1
%C Table starts
%C .0...0.....0.......0.........0...........0.............0...............0
%C .0...4.....4......16........36.........100...........256.............676
%C .0...4....28......64.......372........1444..........6528...........28900
%C .0..16....64.....676......4624.......40000........311364.........2534464
%C .0..36...372....4624.....72852......996004......14644480.......210076036
%C .0.100..1444...40000....996004....26193924.....674752576.....17603451684
%C .0.256..6528..311364..14644480...674752576...31747280900...1482014064400
%C .0.676.28900.2534464.210076036.17603451684.1482014064400.124891129720900
%H R. H. Hardin, <a href="/A203285/b203285.txt">Table of n, a(n) for n = 1..363</a>
%e Some solutions for n=4 k=3
%e ..1..1..1....0..1..0....0..1..1....1..0..1....1..0..1....0..0..0....0..0..1
%e ..0..0..0....0..1..0....0..0..0....1..0..1....1..0..1....1..1..1....1..0..1
%e ..0..1..0....0..1..0....1..1..1....1..0..1....0..1..0....1..0..1....1..0..1
%e ..0..1..1....1..1..0....1..0..0....1..0..0....0..1..0....1..0..0....0..0..1
%K nonn,tabl
%O 1,5
%A _R. H. Hardin_ Dec 31 2011
|
