  The average size of the "smallest gap" of a partition was studied by Grabner
and Knopfmacher in 2006. Recently, Andrews and Newman, motivated by the work of
Fraenkel and Peled, studied the concept of the "smallest gap" under the name
"minimal excludant" of a partition and rediscovered a result of Grabner and
Knopfmacher. In the present paper, we study the sum of the minimal excludants
over partitions into distinct parts, and interestingly we observe that it has a
nice connection with Ramanujan's function $\sigma(q)$. As an application, we
derive a stronger version of a result of Uncu.
