|
%I #4 Jan 25 2013 11:44:29
%S 0,0,0,0,0,0,0,1,0,0,0,3,0,0,0,0,8,5,1,0,0,0,21,24,16,0,0,0,0,55,142,
%T 173,41,1,0,0,0,144,840,1325,744,105,0,0,0,0,377,4919,15936,13682,
%U 4131,288,1,0,0,0,987,28704,187794,252538,109702,19998,735,0,0,0,0,2584,167344
%N T(n,k)=Number of nXk arrays of occupancy after each element moves to some horizontal or antidiagonal neighbor, without 2-loops or left turns
%C Table starts
%C .0.0.0.....0.......0........0..........0..........0...........0............0
%C .0.0.1.....3.......8.......21.........55........144.........377..........987
%C .0.0.0.....5......24......142........840.......4919.......28704.......167344
%C .0.0.1....16.....173.....1325......15936.....187794.....2167196.....25071259
%C .0.0.0....41.....744....13682.....252538....6854851...164812860...3910715845
%C .0.0.1...105....4131...109702....4781652..220782560.12043488477.578442771884
%C .0.0.0...288...19998..1104476...76353254.8468269355
%C .0.0.1...735..104035..9561346.1402260000
%C .0.0.0..1981..520922.89663745
%C .0.0.1..5156.2661269
%C .0.0.0.13685
%C .0.0.1
%H R. H. Hardin, <a href="/A221787/b221787.txt">Table of n, a(n) for n = 1..111</a>
%e All solutions for n=3 k=4
%e ..0..2..2..1....0..1..1..1....0..2..2..1....0..2..1..1....0..2..2..1
%e ..0..2..1..0....0..2..2..0....0..2..2..0....0..1..2..0....0..1..1..0
%e ..1..1..2..0....1..2..2..0....1..1..1..0....1..2..2..0....1..2..2..0
%Y Row 2 is A001906(n-2)
%K nonn,tabl
%O 1,12
%A _R. H. Hardin_ Jan 25 2013
|
