Summary: The number of inversions in a random permutation is a way to measure the extent to which the permutation is "out of order". Let $I_{n}(k)$ denote the number of permutations of length n with k inversions. This paper gives asymptotic formulae for the sequences ${I_{n+k}(n)$, n=1,2,$\dots }$ for fixed k.