TOPICS
Search

Aliquot Sequence


Let

 s(n)=sigma(n)-n,

where sigma(n) is the divisor function and s(n) is the restricted divisor function. Then the sequence of numbers

 s^0(n)=n,s^1(n)=s(n),s^2(n)=s(s(n)),...

is called an aliquot sequence. If the sequence for a given n is bounded, it either ends at s(1)=0 or becomes periodic.

1. If the sequence is a constant, the constant is known as a perfect number. A number that is not perfect, but for which the sequence becomes constant, is known as an aspiring number.

2. If the sequence reaches an alternating pair, it is called an amicable pair.

3. If, after k iterations, the sequence yields a cycle of minimum length t of the form s^(k+1)(n), s^(k+2)(n), ..., s^(k+t)(n), then these numbers form a group of sociable numbers of order t.

The lengths of the aliquot sequences for n=1, 2, ... are 1, 2, 2, 3, 2, 1, 2, 3, 4, 4, 2, 7, 2, 5, 5, 6, 2, ... (OEIS A044050).

It has not been proven that all aliquot sequences eventually terminate and become periodic. The smallest number whose fate is not known is 276. Guy (1994) cites the largest computed value as s^(628)(276), though this has since been extended to s^(1567)(276) (Zimmermann 2008). There are five such sequences less than 1000, namely 276, 552, 564, 660, and 966 (Clavier 2006, Varona 2004), sometimes called the "Lehmer five" (Zimmermann 2008). Furthermore, there are 81 open sequences <=10^4, 908 open sequences <=10^5, and 9452 open sequences <10^6 (Creyaufmüller 2008).


See also

196-Algorithm, Additive Persistence, Aspiring Number, Catalan's Aliquot Sequence Conjecture, Multiamicable Numbers, Multiperfect Number, Multiplicative Persistence, Perfect Number, Sociable Numbers, Unitary Aliquot Sequence

Explore with Wolfram|Alpha

References

Clavier, C. "Aliquot Sequences." May 28, 2008. http://christophe.clavier.free.fr/Aliquot/site/Aliquot.html.Clavier, C. "Aliquot Sequences 276, 552, 564, 660, 996, 1074 and 1134 Pursued by Paul Zimmermann." Dec. 17, 2006. http://christophe.clavier.free.fr/Aliquot/site/zimmermann_table.html.Creyaufmüller, W. "Aliquot Sequences." May 13, 2008. http://www.aliquot.de/aliquote.htm#aliquot%20sequences.Guy, R. K. "Aliquot Sequences." §B6 in Unsolved Problems in Number Theory, 2nd ed. New York: Springer-Verlag, pp. 60-62, 1994.Guy, R. K. and Selfridge, J. L. "What Drives Aliquot Sequences." Math. Comput. 29, 101-107, 1975.Sloane, N. J. A. Sequences A003023/M0062 and A044050 in "The On-Line Encyclopedia of Integer Sequences."Sloane, N. J. A. and Plouffe, S. Figure M0062 in The Encyclopedia of Integer Sequences. San Diego: Academic Press, 1995.Varona, J. L. "Aliquot Sequences." Sep. 16, 2004. http://www.unirioja.es/dptos/dmc/jvarona/aliquot.html.Zimmermann, P. "Aliquot Sequences." Retrieved Jun. 1, 2008. http://www.loria.fr/~zimmerma/records/aliquot.html.

Referenced on Wolfram|Alpha

Aliquot Sequence

Cite this as:

Weisstein, Eric W. "Aliquot Sequence." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/AliquotSequence.html

Subject classifications