|
%I #5 Mar 31 2012 12:37:29
%S 1,1,1,1,1,1,1,2,2,1,1,4,16,4,1,1,8,72,72,8,1,1,16,243,729,243,16,1,1,
%T 32,1125,6480,6480,1125,32,1,1,64,5000,63504,103680,63504,5000,64,1,1,
%U 128,20480,635040,2080800,2080800,635040,20480,128,1,1,256,86528,6350400
%N T(n,k)=Number of nXk array permutations with every element making zero or one right-handed knight moves (out 2, right 1)
%C Table starts
%C .1..1.....1.......1.........1............1..............1................1
%C .1..1.....2.......4.........8...........16.............32...............64
%C .1..2....16......72.......243.........1125...........5000............20480
%C .1..4....72.....729......6480........63504.........635040..........6350400
%C .1..8...243....6480....103680......2080800.......42166080........833285376
%C .1.16..1125...63504...2080800.....92160000.....4045204800.....171889843216
%C .1.32..5000..635040..42166080...4045204800...366400000000...33556714023168
%C .1.64.20480.6350400.833285376.171889843216.33556714023168.6638067426640896
%H R. H. Hardin, <a href="/A209543/b209543.txt">Table of n, a(n) for n = 1..143</a>
%e Some solutions for n=4 k=4
%e ..6..8..2.10....6..1..2..3....6..7..2..3....0..8..2..3....6..7..2..3
%e ..4.12..0..7...10.12..0.14....4..5..0..1....4..5.13..7....4.12..0..1
%e ..1.15..3.11....8..9..4.11...14..9.10.11....1..9.10.11....8..9.10.11
%e ..5.13.14..9....5.13..7.15...12.13..8.15...12..6.14.15....5.13.14.15
%K nonn,tabl
%O 1,8
%A _R. H. Hardin_ Mar 10 2012
|
