Here we examine the number of ways to partition an integer $n$ into $k$th powers when $n$ is large. Simplified proofs of some asymptotic results of Wright are given using the saddle-point method, including exact formulas for the expansion coefficients. The convexity and log-concavity of these partitions is shown for large $n$, and the stronger conjectures of Ulas are proved. The asymptotics of Wright's generalized Bessel functions are also treated.