I think it's helpful to generalize this question to a multi-sided coin (a coin with $m$ sides, which can be thought of as a die, if you will). I will call "side A" the desired outcome (heads for the coin). For two tosses, we can add the probabilities of two independent events.
Probability of getting side A on the first toss:
$\frac 1m$
Probability of not getting "side A" on the first toss, but getting it on the second toss=
$$ p(\rm not side A) \cdot p(\rm side A) = \left(1-\frac 1m\right) \cdot \frac 1m$$
Total probability of getting side A in two tosses is the sum of the two events:
$$\frac 1m + \left(1-\frac 1m\right) \cdot \frac 1m$$
If we continue with more tosses ($n$ total), the probability grows. The probability of not getting "side A" on the first, second, ... or $n-1$th toss, but getting it on the $n$th toss =
$$\left(1-\frac 1m\right)^{n-1} \cdot \frac 1m$$
Total probability of getting "side A" in $n$ tosses is the sum of the independent events:
$$\frac 1m \cdot \left[1 + (1-\frac 1m) + (1-\frac 1m)^2 + \ldots(1-\frac 1m)^{n-1}\right]$$