Unranking permutations in transposition order and linear time
  An algorithm is presented for unranking permutations in transposition order: Given a seed s\in N, the algorithm produces a permutation P(s) that differs from the permutation P(s+1) by the transposition of two elements. 
Konstantinos A. Blekos