On the recurrence fm+1=bmfm−fm−1 and applications

We point out that a natural and direct way of analyzing the recurrence fm+1=bmfm−fm−1 is by means of continued-fractions theory. Applications to exotic numeration systems and to games are given, and previous examinations of the special case fm+1=6fm−fm−1 are pointed out.