Is there order to the number of groups of different orders? I was always struck by how uncharacteristically erratic the behavior of the following function is:
$f: \mathbb{N} \rightarrow \mathbb{N}$ given by $f(n):=$ number of isomorphism classes of groups of order $n$.
I blame this on the introduction of the unnatural idea of looking at the size of the group. Why would we? The same is true in Algebraic Geometry: curves are nicer than surfaces for an arbitrary reason. Looking at the dimension introduces an unnatural agent in the mix.
My question is this:
What is the most "natural" statement (and less preferably: viewpoint) you've ever seen about this $f$? I bar asymptotic statements as inherently unnatural (unless you can convince me otherwise). To open the floor the widest, I'll put a CW stamp on this question.
 A: Even though it is CW, the main part of the question is fairly narrow:  What interesting structure is there in the exact values of the function $f(n)$, the number of groups of order $n$?  As Michael Lugo and Ben Webster pointed out in their remarks, it's much better to re-parametrize the domain using unique factorization:
$$F(x_2,x_3,x_5,x_7,\ldots) = f(2^{x_2}3^{x_3}5^{x_5}7^{x_7}\ldots).$$
Presented in this form, I found a nifty review of the group-counting function.  Here is a summary of some of the results:
$$f(p) = 1 \quad f(p^2) = 2 \quad f(p^3) = 5 \quad f(2^4) = 14 \quad f(p^4) = 15 \;\;\text{($p$ odd)}$$
$$f(pq) = 2 \;\;\text{(if $p|q-1$)} \quad f(pq) = 1 \;\;\text{otherwise} \quad \ldots$$
It seems (I'm not sure if there is a precise theorem) that if you fix the arguments of $F$ but let the primes vary, then its values are always some polynomials in those primes, stitched together with congruences.
As for asymptotic formulas, I don't really know what the word "natural" means, but certainly an asymptotic estimate of the number of groups is extremely important in computational group theory.  It's more important than the exact number.  Consider the obvious computational model of the group $G = \text{GL}(n,p)$.  You can, uniformly in $n$ and $p$, describe, multiply, and invert group elements in any of these groups in polynomial time in $\log |G|$.  Extending this model to all finite groups (or to a sequence of finite groups that includes every finite group at least once) is a major open problem in computational group theory.  As a first step, it would not be possible if there were too many finite groups, so it is an important theorem that there are $2^{O(n^3)}$ groups of order $2^{O(n)}$.  After that, you would like a computationally effective listing of these groups, not just any listing that gives you a bound.  No one can exhibit a specific sequence of groups in which the group law is difficult.  The problem seems to lie entirely in the fact that a complete list of them is unwieldy.
A: The most general statement that I have seen is due to Holder and gives the following result: if $n$ is squarefree, and if $f_p(n)$ is the number of primes $q$ with $q \mid n$ and $p \mid q-1$, then the number of groups of order $n$ is given by $$g(n) = \sum_{d\mid n}\prod_{p\mid d,\;d > 1} \frac{p^{f_p(n/d)}-1}{p-1}.$$
This formula is nic ein that it is exact; of course, the asymptotics here are very hard to extract, and given that there tend to be more groups of non-squarefree order than of squarefree order it is not terribly useful in asymptotic estimates.
A: You might be interested by the paper "Counting groups: gnus, moas and other exotica" by Conway, Dietrich and O'Brien, Math. Intelligencer 30, 6--15, 2008, and other work on p-groups by O'Brien, and/or Eick and her collaborators.
