A099771 Smallest n-aspiring number. That is, a(n) = smallest k such that s^(n)(k) is perfect but s^(n-1)(k) is not, where s(k) is the sum of the aliquot parts of k and s^(i) means iterate s i times.

25, 95, 417, 675, 2541, 3888, 3528, 16256, 13984, 11312, 10648, 10688, 6672, 15364, 20476, 12288, 12636, 32216, 33304, 33896, 34504, 38660, 31824, 15792, 62296, 67304, 49120, 58104, 102740, 82120, 84704, 53680

Offset

1,1

Links

T. D. Noe, Table of n, a(n) for n=1..100

Example

a(2) = 95 because s(s(95)) = s(25) = 6, which is perfect.

Crossrefs

Cf. A063769.

Sequence in context: A010013 A256716 A063769 * A266818 A158547 A144854

Adjacent sequences: A099768 A099769 A099770 * A099772 A099773 A099774

Keyword

nonn

Author

Gabriel Cunningham (gcasey(AT)mit.edu), Nov 11 2004

Status

approved