Is anything known about the function $P(n)$ where,
$$P(n)=|\{ m\leq n :\text{There is a perfect group of order } m\}|.$$
Like asymptotics or a good upper bound?
Is anything known about the function $P(n)$ where,
$$P(n)=|\{ m\leq n :\text{There is a perfect group of order } m\}|.$$
Like asymptotics or a good upper bound?
On
This doesn't answer the question that you asked, but if we let ${\rm Perf}(\le n)$ be the number of isomorphism classes of perfect groups of order up to $n$, then we have the bounds $$n^{l(n)^2/108-cl(n)} \le {\rm Perf}(\le n) \le n^{l(n)^2/48 + l(n)},$$ where $c$ is a constant and $l(n)= \log_2(n)$. This is proved in this paper: "Enumerating Perfect Groups" by D. F. Holt, J. London Math, Soc. 39 (1989), 67-78.
Since there are very large numbers of perfect groups of certain orders, such as $2^n.60$, this doesn't help much with estimating your function $P(n)$.
Note that the crude estimate $n^{O((\log n) ^2)}$ is the same as for the growth rate of all finite groups. But the constant in the exponent is $2/27$ for all groups, and something between $1/108$ and $1/48$ for perfect groups.
I'm not sure what is known about this function, but you might be interested to know that it has (basically) been computed for small values of $n$.
GAP comes with a library of finite perfect groups, including the function
SizesPerfectGroupswhich returns a list of all integers between $1$ and $2 \cdot 10^6$ which occur as the orders of perfect groups. That list isFrom this you can easily compute your function $P(n)$ for $n \leq 2 \cdot 10^6$. Here's a quick plot from Mathematica: