On the least common multiple of Lucas subsequences
From MaRDI portal
Publication:2867690
DOI10.4064/aa161-4-2zbMath1306.11002OpenAlexW2315899171MaRDI QIDQ2867690
Publication date: 20 December 2013
Published in: Acta Arithmetica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4064/aa161-4-2
Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)
Related Items (5)
On the least common multiple of binary linear recurrence sequences ⋮ On the l.c.m. of shifted Lucas numbers ⋮ On the least common multiple of shifted powers ⋮ On the l.c.m. of random terms of binary recurrence sequences ⋮ On the l.c.m. of shifted Fibonacci numbers
This page was built for publication: On the least common multiple of Lucas subsequences