Hint 1: Since the probability model is uniform over all possible colorings, it suffices to count the number of colorings satisfying your condition, and then divide by $2^n$.
Hint 2: Note that $k$ must be even for the condition to make sense. [If you go around the circle, you switch colors $k$ times and then end up at the color you began with.] This ended up being irrelevant.
We now assume $k$ is even.
Hint 3:
To construct a coloring satisfying your condition, one can first mark where the $k$ "color changes" occur. After setting this, there are two possible ways to fill in the colors.
There are $n$ "gaps" between neighboring beads, so there are $\binom{n}{k}$ ways to choose where these color changes are. The probability is thus $$\frac{2 \binom{n}{k}}{2^n} = 2^{-n+1} \binom{n}{k}.$$ As a sanity check note that this result implies $$2^{-n+1}\sum_{\substack{0 \le k \le n\\\text{$k$ even}}}\binom{n}{k} = 2^{-n+1} \frac{2^n}{2} = 1.$$
Thanks to lulu for catching my mistakes.