It's probably easier to find the probability that the sequence does not contain two consecutive A's, then subtract from 1.
There are sequences of 10 letters each of which is an A or a T, and all the sequences are equally likely.
Let's see if we can count the number of sequences which do not contain two consecutive A's. More generally, let's see if we can count the number of sequences of length n which do not contain two consecutive A's; call this number . For brevity, let's say a sequence is "acceptable" if it does not contain two consecutive As.
It's easy to see that
Now suppose we have an acceptable sequence of length n+1 where n > 2. Break the possible sequences into two classes depending on whether the last letter is an A or a T. If the last letter is a T, then the preceding n letters can be any acceptable sequence; there are of these. If the last letter is an A, then the nth letter must be an T, but the first n-1 letters can be any acceptable sequence; so there are of these. Consequently,
Using this equation and what we already know about and , you should be able to compute . Then the probability that a sequence of length 10 does not contain two consecutive As is
and the probability that it contains at least two consecutive As is
P.S.: Here's something for you to think about: What has all this got to do with the Fibonacci numbers?