for allm andn. 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 integersm andn,
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 Un(P, Q) is a divisibility sequence. Moreover, it is a strong divisibility sequence when gcd(P, Q) = 1. Specific examples include:
Any constant sequence is a strong divisibility sequence, which is kUn(1, 0) for n ≥ 1.
Every sequence of the form , for some nonzero integer k, is a divisibility sequence. It is equal to kUn(2, 1).
The Fibonacci numbersFn form a strong divisibility sequence, which is Un(1, −1).
The Mersenne numbers form a strong divisibility sequence, which is Un(3, 2).
The repunit numbers R(b) n for n = 1, 2, ... in any base b form a strong divisibility sequence, which is Un(b + 1, b).
Any sequence of the form for integers is a divisibility sequence, which is (A − B)Un(A + B, AB). If and are coprime then this is a strong divisibility sequence.
Everest, Graham; van der Poorten, Alf; Shparlinski, Igor; Ward, Thomas (2003). Recurrence Sequences. American Mathematical Society. ISBN978-0-8218-3387-2.
Hall, Marshall (1936). "Divisibility sequences of third order". Am. J. Math. 58 (3): 577–584. doi:10.2307/2370976. JSTOR2370976.
Bézivin, J.-P.; Pethö, A.; van der Porten, A. J. (1990). "A full characterization of divisibility sequences". Am. J. Math. 112 (6): 985–1001. doi:10.2307/2374733. JSTOR2374733.
P. Ingram; J. H. Silverman (2012), "Primitive divisors in elliptic divisibility sequences", in Dorian Goldfeld; Jay Jorgenson; Peter Jones; Dinakar Ramakrishnan; Kenneth A. Ribet; John Tate (eds.), Number Theory, Analysis and Geometry. In Memory of Serge Lang, Springer, pp.243–271, ISBN978-1-4614-1259-5