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 1 or 2, and rows and columns in increasing lexicographic order.

A263586

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 1 or 2, and rows and columns in increasing lexicographic order.

Terms

    a(0) =1a(1) =6a(2) =4a(3) =12a(4) =134a(5) =18a(6) =31a(7) =1992a(8) =3035a(9) =70a(10) =89a(11) =27650a(12) =145151a(13) =69084a(14) =292a(15) =230a(16) =343431a(17) =8296414a(18) =14088801a(19) =1643235a(20) =1212a(21) =536a(22) =3777963a(23) =479355276a(24) =3822509358a(25) =1544467524a(26) =38562523a(27) =5028a(28) =1171a(29) =38762619

External references