I was studying some properties of partitions into primes and came across a surprising property. But before I talk about them, I am giving a definition.
Definition. A $k$-tuple $\lambda=(\lambda_1,\lambda_2,...,\lambda_k)$ is called a prime partition of a positive integer $n$ if the following hold:
a) $\lambda_1, \lambda_2, \dots, \lambda_k$ are distinct primes.
b) $\lambda_1 + \lambda_2 + \cdots + \lambda_k = n$.
c) $\lambda_1 < \lambda_2 < \cdots < \lambda_k$.
For example, one of the prime partitions of $10$ is $(2,3,5)$. Now, define $q(n)$ to be the number of all possible prime partitions of $n$. The values of $q(n)$ from $1$ to $20$ are:
$$ 0, 1, 1, 0, 2, 0, 2, 1, 1, 2, 1, 2, 2, 2, 2, 3, 2, 4, 3, 4, \dots$$
The generating function of $q(n)$ is
$$\prod_{p\,\text{ prime}}^{\infty}\frac1{1-n^p}$$
The question
I was (aimlessly) plotting functions in mathematica related to this function, and, after 15 minutes of plotting, I noticed that
$$\log q(n)\sim\pi\sqrt{\frac{2}{3}\pi(n)}$$
where $\pi(n)$ is the prime counting function. This seems a bit hard to prove. I used the prime number theorem to get
$$\log q(n)\sim\pi\sqrt{\frac23\frac n{\log n}}$$
I don't think that this would have an easy proof. Any article/proof of this might help. Another question: is there an asymptotic formula even stronger than this?
Note: I don't know about this result, I got it accidentally.