%I #5 Mar 31 2012 12:36:15
%S 1,2,2,3,24,3,5,152,152,5,8,1168,2961,1168,8,13,8448,76629,76629,8448,
%T 13,21,62272,1818336,7396009,1818336,62272,21,34,456320,44308389,
%U 637586496,637586496,44308389,456320,34,55,3350016,1070959431,56892084785
%N T(n,k)=Number of nXk array permutations with each element making zero or one king moves
%C Table starts
%C ..1.........2..............3...................5........................8
%C ..2........24............152................1168.....................8448
%C ..3.......152...........2961...............76629..................1818336
%C ..5......1168..........76629.............7396009................637586496
%C ..8......8448........1818336...........637586496.............194762146816
%C .13.....62272.......44308389.........56892084785...........62111749014784
%C .21....456320.....1070959431.......5025023852501........19568579061640704
%C .34...3350016....25950094568.....445205174822288......6188469597764755456
%C .55..24579584...628311228261...39407984363284853...1954975627547701307392
%C .89.180376576.15216392096673.3489215319159283593.617793023145579401433088
%H R. H. Hardin, <a href="/A189254/b189254.txt">Table of n, a(n) for n = 1..144</a>
%e Some solutions for 5X3
%e ..0..3..4....0..3..2....0..3..1....0..3..1....0..3..2....0..3..2....0..3..1
%e ..6..1..2....1..8..5....7..5..2....7..2..4....1..4..5....4..7..1....6..2..5
%e ..9..5.10....6..4.10...10..4..8....9..5..8....6.11..7....6..8..5....7..4.11
%e ..7.11..8...12..7.11....6..9.11....6.12.11....9..8.14...13.14.10....9..8.14
%e .12.13.14...13..9.14...12.13.14...13.10.14...10.12.13....9.12.11...12.13.10
%Y Column 1 is A000045(n+1)
%K nonn,tabl
%O 1,2
%A _R. H. Hardin_ Apr 19 2011