No label defined (Q4494907)

The Morgan-Voyce numbers are defined by the recurrence \(B_{n+2}= 3B_{n+1}- B_n\), where \(B_0=0\), \(B_1=1\) (then \(B_n\) is the Fibonacci number \(F_{2n}\)). The author proves that every positive integer \(N\) has a unique representation \(N=\sum_i \alpha_i B_i\) \((i\geq 1)\) with coefficients \(\alpha_i\in \{0,1, 2\}\), where two successive values \(\alpha_i\), \(\alpha_{i+1}\) cannot be 2. He also considers representations of integers by analogous numbers determined by the recurrence with other initial conditions (resulting in \(F_{2n-1}\), \(L_{2n}\), \(L_{2n-1}\), where \(L_n\) is the \(n\)th Lucas number), and sums of these numbers.