Not Too Many Heads

If a coin is flipped 10 times, find the number of possible sequences of heads and tails such that there is at most one pair of consecutive heads.

For example, TTTTTHTHTHTTTTTHTHTH THTHTHHTTTTHTHTHHTTT TTTTTTTTTTTTTTTTTTTT all work, but THHTTTHTHHTHHTTTHTHH does not.

×

Problem Loading...

Note Loading...

Set Loading...