It is well known that the abc conjecture implies that the there are only finitely many solutions to Brocard problem, as shown by Overholt in Overholt, Marius (1993), "The diophantine equation $n! + 1 = m^2$", Bull. London Math. Soc., 25 (2): 104. While trying to extend this result and give some bound on the maximum number of solutions under the abc conjecture, I came out with an inequality of this form:
$$ p_{\pi(n)} \#> C (n!)^{2/3 - \epsilon} $$
for some small $\epsilon >0$ and some constant $C>0$. I would like to prove that this inequality does not hold for $n$ enough large, so I considered the following limit:
$$ \lim_{n \rightarrow \infty} \frac{p_{\pi(n)} \#}{(n!)^{2/3 - \epsilon}} $$
Wolfram alpha does not give me a direct answer, but I think that its value is $0$. Supporting this conjecture, we have for example this, this and this, where I used $\epsilon=0.0001$; these show that the function seems to be decreasing really rapidly to $0$.
Does anybody know how to prove/disprove this, or has any reference for this result?