Fibonacci expressions arising from a coin-tossing scenario involving pairs of consecutive heads

In this article we study a combinatorial scenario which generalizes the wellknown problem of enumerating sequences of coin tosses containing no consecutive heads. It is shown how to derive formulas enumerating, for a fixed value of k, the sequences of length n containing exactly k distinct pairs of consecutive heads. We obtain both exact expressions and asymptotic relations.