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.
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Digital revista |
| Idioma: | in |
| Publicado: |
Universidad Nacional de Colombia y Sociedad Colombiana de Matemáticas
2014
|
| Acceso en línea: | http://www.scielo.org.co/scielo.php?script=sci_arttext&pid=S0034-74262014000200006 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|