A coin flip game and generalizations of Fibonacci numbers

Abstract

We study a game in which one keeps flipping a coin until a given finite string of heads and tails occurs. We find the expected number of coin flips to end the game when the ending string consists of at most four maximal runs of heads or tails or alternates between heads and tails. This leads to some summation identities involving certain generalizations of the Fibonacci numbers.