Inspired by the answers given by these three questions (here, here, and here), what is the general solution for constructing a group with a specific number of Sylow subgroups?
That is, given a prime $p$ and a positive integer $n\equiv1\pmod p$, is it always possible to construct a group $G$ with exactly $n$ subgroups of order $p$?
For example, is it possible to construct a group with exactly $15$ subgroups of order $7$, or exactly $35$ subgroups of order $17$?
From Hölder's Theorem (Theorem 19 here), if there is at least one prime $q \mid n$ such that $q \neq 1\pmod p$, then we can conclude that $g=|G|$ cannot be squarefree.
At the same time, it is not a necessary condition that every prime $q\mid n$ is congruent to $1\pmod p$.
In our example with $n=15$ and $p=7$, we know that $g$ cannot be square-free. From the Sylow Theorems, $np \mid g$, so $g$ is a multiple of $105$. However, $g$ is at least $315$ because of the requirement that $g$ must not be square-free. That is as far as I can get with constructing such groups.
Edit:
Derek's answer suggests that the answer to my original question is false in general. That is, it is not always possible to construct a group with $n$ subgroups of order $p$, even when $n$ is restricted to $1\pmod p$. How would one prove this?
Secondly, under what conditions would there exist a group with exactly $n$ $p$-Sylow subgroups?