The derivation of the Hardy-Ramanujan-Rademacher formula for the number of partitions of n is reviewed. Next, the steps for finding analogous formulas for certain restricted classes of partitions or overpartitions is examined, bearing in mind how these calculations can be automated in a CAS. Finally, a number of new formulas of this type which were conjectured with the aid of Mathematica are presented along with results of a test for their numerical accuracy.