%I A032358
%S A032358 1,1,2,1,2,2,2,2,3,2,3,2,3,3,4,2,3,3,3,3,4,3,4,3,3,3,4,3,4,4,4,4,4,3,4,
%T A032358 3,4,4,5,3,4,4,4,4,5,4,4,4,5,4,5,3,5,4,4,4,5,4,5,4,4,5,5,4,5,5,5,4,5,4,
%U A032358 5,4,5,4,5,4,5,5
%N A032358 Number of iterations of phi(n) needed to reach 2.
%C A032358 a(n) = A003434(n)-1 = A049108(n)-2.
%D A032358 Catlin: Concerning the iterated phi-function. Amer Math. Monthly 77 (1970), 
               pp. 60-61.
%F A032358 a(n) = a(phi(n))+1, a(1) = -1. - Vladeta Jovovic, Apr 29 2003
%Y A032358 Sequence in context: A113793 A083552 A078704 this_sequence A011960 A008615 
               A103221
%Y A032358 Adjacent sequences: A032355 A032356 A032357 this_sequence A032359 A032360 
               A032361
%K A032358 nice,nonn,easy
%O A032358 3,3
%A A032358 Ursula Gagelmann (gagelmann(AT)altavista.net)