Generalization of an identity involving the generalized Fibonacci numbers and its applications.
Mohammad Farrokhi, D.G. (2009)
Integers
Similarity:
Mohammad Farrokhi, D.G. (2009)
Integers
Similarity:
Alexey Stakhov (2012)
Visual Mathematics
Similarity:
Cloitre, Benoit, Sloane, N. J. A., Vandermast, Matthew J. (2003)
Journal of Integer Sequences [electronic only]
Similarity:
Breuer, Florian (2007)
Integers
Similarity:
Hamahata, Y., Kokubun, Y. (2007)
Journal of Integer Sequences [electronic only]
Similarity:
Kiliç, Emrah, Tan, Elif (2010)
Integers
Similarity:
Larry Ericksen (2006)
Acta Mathematica Universitatis Ostraviensis
Similarity:
We examine the congruences and iterate the digit sums of integer sequences. We generate recursive number sequences from triple and quintuple product identities. And we use second order recursions to determine the primality of special number systems.
Vinh, Le Anh (2007)
Journal of Integer Sequences [electronic only]
Similarity:
Grundman, H.G., Teeple, E.A. (2007)
Journal of Integer Sequences [electronic only]
Similarity:
Kimberling, Clark (2007)
Journal of Integer Sequences [electronic only]
Similarity:
Diego Marques, Alain Togbé (2011)
Colloquium Mathematicae
Similarity:
In 2000, Florian Luca proved that F₁₀ = 55 and L₅ = 11 are the largest numbers with only one distinct digit in the Fibonacci and Lucas sequences, respectively. In this paper, we find terms of a linear recurrence sequence with only one block of digits in its expansion in base g ≥ 2. As an application, we generalize Luca's result by finding the Fibonacci and Lucas numbers with only one distinct block of digits of length up to 10 in its decimal expansion.
Horst Alzer, Florian Luca (2022)
Mathematica Bohemica
Similarity:
We extend an inequality for Fibonacci numbers published by P. G. Popescu and J. L. Díaz-Barrero in 2006.