Have a personal or library account? Click to login
The GCD Sequences of the Altered Lucas Sequences Cover

The GCD Sequences of the Altered Lucas Sequences

By: Fikri Koken  
Open Access
|Jun 2020

Abstract

In this study, we give two sequences {L+n}n≥1 and {Ln}n≥1 derived by altering the Lucas numbers with {±1, ±3}, terms of which are called as altered Lucas numbers. We give relations connected with the Fibonacci Fn and Lucas Ln numbers, and construct recurrence relations and Binet’s like formulas of the L+n and Ln numbers. It is seen that the altered Lucas numbers have two distinct factors from the Fibonacci and Lucas sequences. Thus, we work out the greatest common divisor (GCD) of r-consecutive altered Lucas numbers. We obtain r-consecutive GCD sequences according to the altered Lucas numbers, and show that their GCD sequences are unbounded or periodic in terms of values r.

DOI: https://doi.org/10.2478/amsil-2020-0005 | Journal eISSN: 2391-4238 | Journal ISSN: 0860-2107
Language: English
Page range: 222 - 240
Submitted on: Jun 19, 2019
Accepted on: Mar 16, 2020
Published on: Jun 22, 2020
Published by: University of Silesia in Katowice, Institute of Mathematics
In partnership with: Paradigm Publishing Services
Publication frequency: 2 issues per year

© 2020 Fikri Koken, published by University of Silesia in Katowice, Institute of Mathematics
This work is licensed under the Creative Commons Attribution 4.0 License.