82120domain: NAppears in sequencesSmallest 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.at n=29A099771G.f. A(x) satisfies: A(x) = x * Product_{k>=1} (1 + A(x^k))/(1 - A(x^k)).at n=8A308368