Divisibility sequence
Template:Short description Template:No footnotes In mathematics, a divisibility sequence is an integer sequence indexed by positive integers Template:Mvar such that
for all Template:Mvar and Template:Mvar. That is, whenever one index is a multiple of another one, then the corresponding term also is a multiple of the other term. The concept can be generalized to sequences with values in any ring where the concept of divisibility is defined.
A strong divisibility sequence is an integer sequence such that for all positive integers Template:Mvar and Template:Mvar,
where Template:Math is the greatest common divisor function.
Every strong divisibility sequence is a divisibility sequence: if and only if . Therefore, by the strong divisibility property, and therefore .
Examples
Any Lucas sequence of the first kind Template:Math is a divisibility sequence. Moreover, it is a strong divisibility sequence when Template:Math. Specific examples include:
- Any constant sequence Template:Tmath is a strong divisibility sequence, which is Template:Math for Template:Math.
- Every sequence of the form Template:Tmath, for some nonzero integer Template:Mvar, is a divisibility sequence. It is equal to Template:Math.
- The Fibonacci numbers Template:Math form a strong divisibility sequence, which is Template:Math.
- The Mersenne numbers form a strong divisibility sequence, which is Template:Math.
- The repunit numbers Template:Math for Template:Math in any base Template:Mvar form a strong divisibility sequence, which is Template:Math.
- Any sequence of the form for integers is a divisibility sequence, which is Template:Math. If and are coprime then this is a strong divisibility sequence.
Elliptic divisibility sequences are another class of divisibility sequences.