  We study combinatorial and asymptotic properties of the rank of strongly
unimodal sequences. We find a generating function for the rank enumeration
function, and give a new combinatorial interpretation of the ospt-function
introduced by Andrews, Chan, and Kim. We conjecture that the enumeration
function for the number of unimodal sequences of a fixed size and varying rank
is log-concave, and prove an asymptotic result in support of this conjecture.
Finally, we determine the asymptotic behavior of the rank for strongly unimodal
sequences, and prove that its values (when appropriately renormalized) are
normally distributed with mean zero in the asymptotic limit.
