Forgot password? New user? Sign up

Existing user? Log in

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, $TTTTTHTHTH$ $THTHTHHTTT$ $TTTTTTTTTT$ all work, but $THHTTTHTHH$ does not.

Problem Loading...

Note Loading...

Set Loading...