|
%I #5 Nov 10 2015 12:35:01
%S 6,40,36,118,606,158,354,5900,8783,614,1209,63788,246718,135933,2596,
%T 4334,832934,7955810,11302184,2222154,11045,14525,9289071,346346808,
%U 1265538562,567198796,36482594,47252,46022,99951445,13232164013
%N T(n,k)=Number of (n+2)X(k+2) arrays of permutations of 0..(n+2)*(k+2)-1 filled by rows with each element moved 0 or 1 knight moves, and rows and columns in increasing lexicographic order.
%C Table starts
%C .....6.......40.......118........354......1209........4334....14525.46022
%C ....36......606......5900......63788....832934.....9289071.99951445
%C ...158.....8783....246718....7955810.346346808.13232164013
%C ...614...135933..11302184.1265538562
%C ..2596..2222154.567198796
%C .11045.36482594
%C .47252
%F Empirical for row n:
%F n=1: [linear recurrence of order 79] for n>86
%e Some solutions for n=2 k=4
%e ..0..1.10.11.15.16....0..1..2..3..4.16....0..1..6..7..8..9....0..1..2..3.15.16
%e ..2.18.19..5.21..3....6.15.19..9.23.11....2.15.16.22.21..3....6..7.19.20.10.11
%e .12.13..6..7.20..4...12.13.14..7..5.21...12.13.14.23..5..4...12.13.14..4..5.17
%e .14..8..9.17.22.23...18..8.20.17.22.10...18.19.20.17.11.10...18..8..9.21.22.23
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Oct 30 2015
| 