%I A059447
%S A059447 1,2,4,9,14,16,12,34,52,90,60,66,54,42,30,126,114,102,624,760,680,580,
%T A059447 540,748,740,520,672,408,666,360,264,546,510,330,318,2960,2574,1782,
%U A059447 1494,3672,3114,2790,1680,1386,1374,930,612,594,582,378,366,180,3570
%N A059447 Smallest number which takes n steps to get to 1 under the map f(n)=sigma(n)-n, 
               the sum of the proper divisors.
%H A059447 T. D. Noe, <a href="b059447.txt">Table of n, a(n) for n=0..150</a>
%e A059447 a(4)=14 since 14->10->8->7->1 and no smaller number takes 4 steps.
%Y A059447 Cf. A003023 (length of aliquot sequence for n)
%Y A059447 Sequence in context: A090942 A085901 A077224 this_sequence A078671 A119637 
               A113862
%Y A059447 Adjacent sequences: A059444 A059445 A059446 this_sequence A059448 A059449 
               A059450
%K A059447 nice,nonn
%O A059447 0,2
%A A059447 Erich Friedman (efriedma(AT)stetson.edu), Feb 02 2001
%E A059447 More terms from T. D. Noe (noe(AT)sspectra.com), Nov 27 2006