Your use of the word “share” is a bit confusing to me, so I’ll reformulate the questions to make sure we mean the same thing:
What is the probability $p_k$ that there are exactly $k\le n$ months that contain at least one of $n$ birthdays independently uniformly randomly distributed over the months?
What is the probability $q_k$ that there are at most $k\le n$ months that contain at least one of $n$ birthdays independently uniformly randomly distributed over the months?
(I switched $\lt$ to $\le$ because we can also ask the questions for $k=n$.)
The two questions are roughly similarly difficult. The easy question in this context is:
What is the probability $b_k$ that the $n$ birthdays independently uniformly randomly distributed over the months all lie in one of $k\le n$ particular months?
This is just the $n$-th power of the probability that one of the birthdays lies in one of these months, so
$$
b_k=\left(\frac k{12}\right)^n\;.
$$
The answers to your questions can be calculated from these probabilities $p_k$ using inclusion–exclusion in the form of a Generalised inclusion-exclusion principle. For your first question:
$$
p_j=\sum_{k=0}^j(-1)^{k-j}\binom{n-k}{n-j}\binom nkb_k\;.
$$
If you write this out for $j=1$ and $j=2$, you get your two results for $n=6$.
Summing over $j$ yields the answer to your second question:
\begin{eqnarray}
q_j
&=&
\sum_{\ell=0}^jp_\ell
\\
&=&
\sum_{\ell=0}^j\sum_{k=0}^\ell(-1)^{k-\ell}\binom{n-k}{n-\ell}\binom nkb_k\;.
\\
&=&
\sum_{k=0}^j\sum_{\ell=k}^j(-1)^{k-\ell}\binom{n-k}{n-\ell}\binom nkb_k\;.
\\
&=&
\sum_{k=0}^j(-1)^{k-j}\binom{n-k-1}{n-j-1}\binom nkb_k\;.
\end{eqnarray}
So this is the same sort of sum as for the first question, just with the upper and lower indices of one of the binomial coefficients both decremented. If you write this out for $j=1$ and $j=2$, you get
$$
q_1=\binom{12}1\left(\frac1{12}\right)^n
$$
and
$$
q_2=\binom{12}2\left(\frac2{12}\right)^n-\binom{10}9\binom{12}1\left(\frac1{12}\right)^n
$$
which is also what you would have obtained if you’d added your results for $j=1$ and $j=2$ to get $q_2=p_1+p_2$.