Answers are grounded in this paper and cite their sources.
In 2014, E. F. Bravo, J. J. Bravo, and F. Luca investigated the Diophantine equation Lₙ⁽ᵏ⁾ = Lₘ⁽ˡ⁾ for k > ℓ ≥ 2, where (Lₙ⁽ᵏ⁾)ₙ≥₂₋ₖ denotes the k-generalized Lucas sequence, and concluded in Theorem 1.1 and Corollary 1.2 (The Fibonacci Quarterly 52(4), 296–306, 2014) that the only solutions with n, m ≥ 0 are the trivial coincidences n = m ∈ {0, 1, …, ℓ}. In this note, we show that (n, k, m, ℓ) = (12, 4, 16, 2) is a non-trivial solution: L₁₂⁽⁴⁾ = L₁₆⁽²⁾ = 2207. Assuming the analytic Matveev and Baker–Davenport bounds of Bravo, Bravo, and Luca (2014), we complete their finite computer verification and show that 2207 is the only non-trivial coincidence across all pairs k > ℓ ≥ 2; we also record a numerical observation about the Binet terms involved.
No takes yet. Share an insight, caveat, or question.
Tyler Archie Jones (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: