$\mathbb{Q}$-bonacci words and numbers

We give a generalization of $k$-bonacci numbers where $k$ is a positive rational number. These numbers enumerate binary words of size $n$ whose maximal factors of the form $0^a1^b$ satisfy $ak > b$ or $a = 0$.