Card Problem from Gardner The following problem is from aha! Insight by Martin Gardner.

On a draw of $n$ cards from a deck without replacement, what is the
  probability that seven of the $n$ cards all have the same suit?

It has been a while since I have done a probability computation so I am here to have my solution verified.
Let $X_n$ be the random event of drawing at least seven cards of the same suit upon drawing $n$ cards. 
$$P(X_n) = \left\{
     \begin{array}{ll}
       0 & : n < 7\\
       \dfrac{\binom{4}{1}\binom{13}{7}\binom{39}{n-7}}{\binom{52}{n}} & : 7 \le n < 25\\
       1 & : 25 \le n
     \end{array}
   \right. $$
EDIT: So this counts the number of ways to draw exactly seven cards with $n$ draws. Robert's post gives the desired answer, but I am wondering if there is a simpler expression for the probability given solely in terms of $n$.
EDIT2: Started bounty looking for a solution in terms of $n$. I would also accept an explanation as to why Robert's solution is as simple as it gets.
 A: Here is a Mathematica code that returns Robert's computations above:
Table[f[list_] := 
  Binomial[13, list[[1]]] Binomial[13, list[[2]]] Binomial[13, 
    list[[3]]] Binomial[13, list[[4]]]/Binomial[52, n]; 
 Total[Map[f, Select[Compositions[n, 4], Max[#] >= 7 &]]], {n, 7, 25}]
A: Let's consider a simpler problem with only two suits, say spades and hearts.  Lets suppose there are $S$ cards of each suit in the deck, that you will choose $n$ cards, and that you want to know the probability of getting $k$ or more cards of at least one suit.
The probability of getting exactly $k$ spades is
$$
\frac{\binom{S}{k}\binom{S}{n-k}}{\binom{2S}{n}}.
$$
The probability of getting $k$ or more spades is
$$
\sum_{j=k}^n\frac{\binom{S}{j}\binom{S}{n-j}}{\binom{2S}{n}}.
$$
The probability of getting $k$ or more cards of at least one suit can be obtained using the principle of inclusion-exclusion by adding the probability of getting $k$ or more spades to the probability of getting $k$ or more hearts, and then subtracting the probability of getting $k$ or more of both suits.  This computation gives
$$
2\sum_{j=k}^n\frac{\binom{S}{j}\binom{S}{n-j}}{\binom{2S}{n}}-\sum_{j=k}^{n-k}\frac{\binom{S}{j}\binom{S}{n-j}}{\binom{2S}{n}}.
$$
There is no simple, closed form for these sums.  They can be expressed in terms of the cumulative distribution function of the hypergeometric distribution.  The linked Wikipedia article gives the formula for the cumulative distribution function in terms of a ${}_3F_2$ generalized hypergeometric function, but this is no help, since the generalized hypergeometric function is defined to be precisely the kind of sum of products that I presume you're trying to get away from.
There is an algorithm for determining when sums such as these have a closed form, under suitable definition of "closed form".  See the Wikipedia articles on Gosper's algorithm and Wilf–Zeilberger pairs and the references in those articles for information about this.  I am not in a position at the moment to tell you what this theory has to say about the sums above, but, suffice it to say, there is no closed form.
When you increase the number of suits to four, things get more complicated.  The principle of inclusion-exclusion yields the formula
$$
\begin{aligned}
&4\sum_{h=k}^n\frac{\binom{S}{h}\binom{3S}{n-h}}{\binom{4S}{n}}-6\sum_{h=k}^n\sum_{i=k}^{n-h}\frac{\binom{S}{h}\binom{S}{i}\binom{2S}{n-h-i}}{\binom{4S}{n}}+4\sum_{h=k}^n\sum_{i=k}^{n-h}\sum_{j=k}^{n-h-i}\frac{\binom{S}{h}\binom{S}{i}\binom{S}{j}\binom{S}{n-h-i-j}}{\binom{4S}{n}}\\
&\qquad-\sum_{h=k}^n\sum_{i=k}^{n-h}\sum_{j=k}^{n-h-i-k}\frac{\binom{S}{h}\binom{S}{i}\binom{S}{j}\binom{S}{n-h-i-j}}{\binom{4S}{n}}
\end{aligned}
$$
for the probability of $k$ or more cards of at least one suit.  Only the first of the sums in this formula can be expressed in terms of generalized hypergeometric functions.  I am not sure whether the Wilf-Zeilberger method can be extended to multiple sums, but, given the difficulties that present themselves even in the two-suit case, it is almost certain that there is no closed form.
