It is known that binary words containing no $k$ consecutive 1s are enumerated by $k$-step Fibonacci numbers. In this note we discuss the expected value of a random bit in a random word of length $n$ having this property.

翻译：众所周知,不包含一元连续一元的二进制单词是用 $k$-step Fibonacci 数字列出的。 在本说明中,我们讨论随机位数的预期值, 随机单词长度为 $n 。