Records in set partitions

A partition of [n] = {1, 2, ... , n} is a decomposition of [n] into nonempty subsets called blocks. We will make use of the canonical representation of a partition as a word over a finite alphabet, known as a restricted growth function. An element a(i) in such a word pi is a strong (weak) record if a(i) > a(j) (a(i) >= a(j)) for all j = 1, 2, ... , i-1. Furthermore, the position of this record is i. We derive generating functions for the total number of strong (weak) records in all words corresponding to partitions of [n], as well as for the sum of the positions of the records. In addition we find the asymptotic mean values and variances for the number, and for the sum of positions, of strong (weak) records in all partitions of [n].