  The Hardy-Ramanujan formula for the number of integer partitions of $n$ is
one of the most popular results in partition theory. While the unabridged final
formula has been celebrated as reflecting the genius of its authors, it has
become all too common to attribute either some simplified version of the
formula which is not as ingenious, or an alternative more elegant version which
was expanded on afterwards by other authors. We attempt to provide a clear and
compelling justification for distinguishing between the various formulas and
simplifications, with a summarizing list of key take-aways in the final
section.
