T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..n*k-1 with each element moved a city block distance of exactly 2.
A263389
T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..n*k-1 with each element moved a city block distance of exactly 2.
Terms
- a(0) =1a(1) =4a(2) =4a(3) =16a(4) =144a(5) =16a(6) =36a(7) =1600a(8) =1600a(9) =36a(10) =169a(11) =17376a(12) =70225a(13) =17376a(14) =169a(15) =576a(16) =240100a(17) =2205225a(18) =2205225a(19) =240100a(20) =576a(21) =2025a(22) =3187140a(23) =85599504a(24) =188020096a(25) =85599504a(26) =3187140a(27) =2025a(28) =7056a(29) =40513225
External references
- oeis: A263389