Asymptotic behavior of permutation records

We study the asymptotic behavior of two statistics defined on the symmetric group Sn when n tends to infinity: the number of elements of Sn having k records, and the number of elements of Sn for which the sum of the positions of their records is k. We use a probabilistic argument to show that the scaled asymptotic behavior of these statistics can be described by remarkably simple functions.