Powers of Two in Generalized Fibonacci Sequences
The k-generalized Fibonacci sequence \big(Fn(k)\big)n resembles the Fibonacci sequence in that it starts with 0,…,0,1 (k terms) and each term afterwards is the sum of the k preceding terms. In this paper, we are interested in finding powers of two that appear in k-generalized Fibonacci sequences; i.e., we study the Diophantine equation Fn(k)=2m in positive integers n,k,m with k≥ 2.
Saved in:
Main Authors: | BRAVO,JHON J., LUCA,FLORIAN |
---|---|
Format: | Digital revista |
Language: | English |
Published: |
Universidad Nacional de Colombia y Sociedad Colombiana de Matemáticas
2012
|
Online Access: | http://www.scielo.org.co/scielo.php?script=sci_arttext&pid=S0034-74262012000100005 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Power of Two--Classes in k--Generalized Fibonacci Sequences
by: GÓMEZ,CARLOS ALEXIS, et al.
Published: (2014) -
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)