Square array A(n,k), n >= 1, k >= 1, read by antidiagonals, where A(n,k) is the number of permutations of n copies of 1..k introduced in order 1..k with no element equal to another within a distance of 1.
A322013
Square array A(n,k), n >= 1, k >= 1, read by antidiagonals, where A(n,k) is the number of permutations of n copies of 1..k introduced in order 1..k with no element equal to another within a distance of 1.
Terms
- a(0) =1a(1) =1a(2) =0a(3) =1a(4) =1a(5) =0a(6) =1a(7) =5a(8) =1a(9) =0a(10) =1a(11) =36a(12) =29a(13) =1a(14) =0a(15) =1a(16) =329a(17) =1721a(18) =182a(19) =1a(20) =0a(21) =1a(22) =3655a(23) =163386a(24) =94376a(25) =1198a(26) =1a(27) =0a(28) =1a(29) =47844
External references
- oeis: A322013