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 1 or 2, and rows and columns in increasing lexicographic order.
A263506
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 1 or 2, and rows and columns in increasing lexicographic order.
Terms
- a(0) =8a(1) =48a(2) =59a(3) =204a(4) =2282a(5) =360a(6) =770a(7) =54924a(8) =78306a(9) =2196a(10) =2687a(11) =1111442a(12) =8349744a(13) =2785493a(14) =13704a(15) =8559a(16) =20380008a(17) =830632993a(18) =1425379543a(19) =101776538a(20) =85189a(21) =25383a(22) =337841109a(23) =77648070968a(24) =714115802545a(25) =255768846517a(26) =3683279274a(27) =528559a(28) =71498
External references
- oeis: A263506