TOPICS
Search

Aspiring Number


An aspiring number is a positive integer that is not a perfect number but whose aliquot sequence eventually reaches a perfect number. Let

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

where sigma(n) is the divisor function and s(n) is the restricted divisor function, and define the aliquot sequence of n by

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

If the sequence becomes constant at a positive value m, then s(m)=m, so m is a perfect number. For example, beginning with 25 gives the sequence 25, 6, 6, 6, ..., so 25 is an aspiring number and 6 is a perfect number.

The first few known aspiring numbers are 25, 95, 119, 143, ... (OEIS A063769). It is not known if 276 is an aspiring number, since the eventual behavior of its aliquot sequence remains unknown.


Explore with Wolfram|Alpha

References

Sloane, N. J. A. Sequence A063769 in "The On-Line Encyclopedia of Integer Sequences."

Referenced on Wolfram|Alpha

Aspiring Number

Cite this as:

Weisstein, Eric W. "Aspiring Number." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/AspiringNumber.html

Subject classifications