%I #5 Mar 31 2012 12:36:14
%S 0,1,1,2,9,2,9,265,265,9,24,8132,78976,8132,24,57,154564,22666641,
%T 22666641,154564,57,140,2790864,4064659324,62394485617,4064659324,
%U 2790864,140,376,55327556,741295637637,109564294856817,109564294856817
%N T(n,k)=Number of nXk array permutations with each element moved and moved by a city block distance of no more than three
%C Table starts
%C ...0........1............2...............9..............24...........57
%C ...1........9..........265............8132..........154564......2790864
%C ...2......265........78976........22666641......4064659324.741295637637
%C ...9.....8132.....22666641.....62394485617.109564294856817
%C ..24...154564...4064659324.109564294856817
%C ..57..2790864.741295637637
%C .140.55327556
%C .376
%H R. H. Hardin, <a href="/A188966/b188966.txt">Table of n, a(n) for n = 1..39</a>
%e Some solutions for 5X3
%e ..1..0..3....1..0..3....1..0..3....1..0..3....1..0..3....1..0..3....1..0..3
%e ..2..7..6....2..7..8....2..7..6....2..7..8....2..7..8....2..7..8....2..7..8
%e ..8..5.13....4.14.10....8.14..5....9..6..5...12..4.13....4..9.13....5.10..4
%e .14.12..4...13..5..6...13.11..4...13.14..4....6..9.14...11.14..5...12..9..6
%e .10..9.11....9.11.12...10.12..9...10.12.11...11.10..5...10..6.12...11.14.13
%Y Column 1 is A079997
%K nonn,tabl
%O 1,4
%A _R. H. Hardin_ Apr 14 2011