|
%I #4 Jan 19 2013 20:48:26
%S 0,1,1,2,10,2,4,72,71,4,8,503,1930,494,8,16,3517,48018,47976,3448,16,
%T 32,24546,1200093,4107189,1196232,24055,32,64,171268,29961271,
%U 354947070,354544219,29856238,167811,64,128,1194876,747830157,30632388919
%N T(n,k)=Number of nXk arrays of occupancy after each element moves to some horizontal, vertical or antidiagonal neighbor, without move-in move-out left turns
%C Table starts
%C ...0.......1.........2...........4............8..........16............32
%C ...1......10........72.........503.........3517.......24546........171268
%C ...2......71......1930.......48018......1200093....29961271.....747830157
%C ...4.....494.....47976.....4107189....354947070.30632388919.2643033185667
%C ...8....3448...1196232...354544219.106036544373
%C ..16...24055..29856238.30591390580
%C ..32..167811.745144793
%C ..64.1170709
%C .128
%H R. H. Hardin, <a href="/A221551/b221551.txt">Table of n, a(n) for n = 1..49</a>
%e Some solutions for n=3 k=4
%e ..2..1..0..1....1..0..1..1....0..2..0..0....1..0..0..0....2..2..0..0
%e ..1..0..0..1....4..1..0..1....2..2..1..1....1..2..3..0....1..0..3..2
%e ..1..2..1..2....1..1..0..1....0..2..2..0....1..2..2..0....0..1..1..0
%K nonn,tabl
%O 1,4
%A _R. H. Hardin_ Jan 19 2013
|
