Jia Huang
Published 2025-01-13, updated 2025-01-30Version 2
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.
Comments: 12 pages, minor revision, new references
Generalizations of some identities involving the fibonacci numbers
On the number of vertices of each rank in phylogenetic trees and their generalizations
Statistical Distributions and $q$-Analogues of $k$-Fibonacci Numbers
![QR code for arXiv:2501.07463 [math.CO]](http://oss.arxitics.com/images/favicon.svg)