Aliquot sequence

In mathematics, an aliquot sequence is a sequence of positive integers in which each term is the sum of the proper divisors of the previous term. If the sequence reaches the number 1, it ends, since the sum of the proper divisors of 1 is 0.
Definition and overview.
The aliquot sequence starting with a positive integer "k" can be defined formally in terms of the sum-of-divisors function σ1 or the aliquot sum function "s" in the following way:
and "s"(0) is undefined.
For example, the aliquot sequence of 10 is 10, 8, 7, 1, 0 because:
Many aliquot sequences terminate at zero; all such sequences necessarily end with a prime number followed by 1 (since the only proper divisor of a prime is 1), followed by 0 (since 1 has no proper divisors). See for a list of such numbers up to 75. There are a variety of ways in which an aliquot sequence might not terminate:
The lengths of the Aliquot sequences that start at "n" are
The final terms (excluding 1) of the Aliquot sequences that start at "n" are
Numbers whose Aliquot sequence terminates in 1 are
Numbers whose Aliquot sequence known to terminate in a perfect number, other than perfect numbers themselves (6, 28, 496, ...), are 
Numbers whose Aliquot sequence terminates in a cycle with length at least 2 are
Numbers whose Aliquot sequence is not known to be finite or eventually periodic are
A number that is never the successor in an aliquot sequence is called an untouchable number.
Catalan–Dickson conjecture.
An important conjecture due to Catalan, sometimes called the Catalan–Dickson conjecture, is that every aliquot sequence ends in one of the above ways: with a prime number, a perfect number, or a set of amicable or sociable numbers. The alternative would be that a number exists whose aliquot sequence is infinite yet never repeats. Any one of the many numbers whose aliquot sequences have not been fully determined might be such a number. The first five candidate numbers are often called the Lehmer five (named after D.H. Lehmer): 276, 552, 564, 660, and 966. However, it is worth noting that 276 may reach a high apex in its aliquot sequence and then descend; the number 138 reaches a peak of 179931895322 before returning to 1.
Guy and Selfridge believe the Catalan–Dickson conjecture is false (so they conjecture some aliquot sequences are unbounded above (or diverge)).
, there were 898 positive integers less than 100,000 whose aliquot sequences have not been fully determined, and 9190 such integers less than 1,000,000.
Systematically searching for aliquot sequences.
The aliquot sequence can be represented as a directed graph, formula_1, for a given integer formula_2, where formula_3 denotes the
sum of the proper divisors of formula_4.
Cycles in formula_1 represent sociable numbers within the interval formula_6. Two special cases are loops that represent perfect numbers and cycles of length two that represent amicable pairs.