Powers of two as sum of two generalized Fibonacci numbers

From MaRDI portal




Abstract: For kgeq2, the k-generalized Fibonacci sequence (Fn(k))n is defined by the initial values 0,0,ldots,0,1 (k terms) and such that each term afterwards is the sum of the k preceding terms. In this paper, we search for powers of two of the form Fn(k)+Fm(k). This work is related to a recent result by Bravo and Luca concerning the case k=2.














This page was built for publication: Powers of two as sum of two generalized Fibonacci numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6254519)