EUDML | Pure powers and power classes in recurrence sequences

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “Pure powers and power classes in recurrence sequences”

Generalization of an identity involving the generalized Fibonacci numbers and its applications.

Mohammad Farrokhi, D.G. (2009)

Integers

Similarity:

Lucas sequences whose nth term is a square or an almost square

A. Bremner, N. Tzanakis (2007)

Acta Arithmetica

Similarity:

Perfect powers in products of integers from a block of consecutive integers

T. Shorey (1987)

Acta Arithmetica

Similarity:

A generalization of the Cassini formula

Alexey Stakhov (2012)

Visual Mathematics

Similarity:

Lucas balancing numbers

Kálmán Liptai (2006)

Acta Mathematica Universitatis Ostraviensis

Similarity:

A positive $n$ is called a balancing number if $1 + 2 + \dots + (n - 1) = (n + 1) + (n + 2) + \dots + (n + r) .$ We prove that there is no balancing number which is a term of the Lucas sequence.

Counting Keith numbers.

Klazar, Martin, Luca, Florian (2007)

Journal of Integer Sequences [electronic only]

Similarity:

$F_{1} F_{2} F_{3} F_{4} F_{5} F_{6} F_{8} F_{10} F_{12} = 11!$ .

Luca, Florian, Stănică, Pantelimon (2006)

Portugaliae Mathematica. Nova Série

Similarity:

Generalization of a result of Hoggatt and Bergum on Fibonacci numbers

Morgado, José (1983-1984)

Portugaliae mathematica

Similarity: