Power of Two--Classes in k--Generalized Fibonacci Sequences
The k-generalized Fibonacci sequence \big(Fn(k)\big)n\geq 2-k is the linear recurrent sequence of order k, whose first k terms are 0, …, 0, 1 and each term afterwards is the sum of the preceding k terms. Two or more terms of a k-generalized Fibonacci sequence are said to be in the same power of two-class if the largest odd factors of the terms are identical. In this paper, we show that for each k\ge 2, there are only two kinds of power of two-classes in a k-generalized Fibonacci sequence: one, whose terms are all the powers of two in the sequence and the other, with a single term.
Saved in:
Main Authors: | GÓMEZ,CARLOS ALEXIS, LUCA,FLORIAN |
---|---|
Format: | Digital revista |
Language: | in |
Published: |
Universidad Nacional de Colombia y Sociedad Colombiana de Matemáticas
2014
|
Online Access: | http://www.scielo.org.co/scielo.php?script=sci_arttext&pid=S0034-74262014000200006 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Powers of Two in Generalized Fibonacci Sequences
by: BRAVO,JHON J., et al.
Published: (2012) -
A generalization of Fibonacci sequence
by: Kumar Paul,Neeraj, et al.
Published: (2020) -
Some generalized results related to Fibonacci sequence
by: Paul,Neeraj Kumar, et al.
Published: (2021) -
An indirect evidence of the Fibonacci String model for DNA repetitive sequence growth.
by: YAMAGISHI, M. E. B., et al.
Published: (2008-02-21) -
Fibonacci Numbers [electronic resource] /
by: Vorobiev, Nicolai N. author., et al.
Published: (2002)