A099771 - cp's OEIS frontend

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.

%I A099771 #3 Nov 11 2010 07:34:06
%S A099771 25,95,417,675,2541,3888,3528,16256,13984,11312,10648,10688,6672,
%T A099771 15364,20476,12288,12636,32216,33304,33896,34504,38660,31824,15792,
%U A099771 62296,67304,49120,58104,102740,82120,84704,53680
%N 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.
%H A099771 T. D. Noe, <a href="/A099771/b099771.txt">Table of n, a(n) for n=1..100</a>
%e A099771 a(2) = 95 because s(s(95)) = s(25) = 6, which is perfect.
%Y A099771 Cf. A063769.
%K A099771 nonn
%O A099771 1,1
%A A099771 Gabriel Cunningham (gcasey(AT)mit.edu), Nov 11 2004

cp's OEIS Frontend

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.