T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 filled by rows with each element moved a city block distance of 0 or 2, and rows and columns in increasing lexicographic order.
A263602
T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 filled by rows with each element moved a city block distance of 0 or 2, and rows and columns in increasing lexicographic order.
Terms
- a(0) =2a(1) =7a(2) =8a(3) =15a(4) =144a(5) =24a(6) =27a(7) =1687a(8) =1962a(9) =60a(10) =55a(11) =13455a(12) =69792a(13) =24091a(14) =160a(15) =109a(16) =105222a(17) =1880912a(18) =2736666a(19) =317857a(20) =448a(21) =199a(22) =747253a(23) =51961032a(24) =248766606a(25) =123176874a(26) =4177099a(27) =1232a(28) =347a(29) =4989566
External references
- oeis: A263602