On the intersection of k-Lucas sequences and some binary sequences

From MaRDI portal
Publication:2077902





Lucas sequence \((L_n)\) is determined by \(L_0=2\); \(L_1=1\); \(L_n=L_{n-1}+L_{n-2}\), if \(n\ge 2\). The paper studies \(k\)-generalized \((k\ge 3)\) Lucas sequence. The sequence starts with the \(k\) terms \(0,\dots,0,2, 1\) and each term afterwards is the sum of the \(k\) preceding terms. The paper finds among its terms Fibonacci, Pell or Pell-Lucas numbers.











This page was built for publication: On the intersection of \(k\)-Lucas sequences and some binary sequences

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