The <i>spt</i> -function of Andrews
The <i>spt</i> -function of Andrews
Recently, Andrews introduced the function s(n) = spt(n) which counts the number of smallest parts among the integer partitions of n. We show that its generating function satisfies an identity analogous to Ramanujan's mock theta identities. As a consequence, we are able to completely determine the parity of s(n). Using …