%I #14 Oct 12 2013 15:29:00
%S 0,1,1,2,1,2,1,2,2,2,1,2,1,2,2,3,1,2,1,2,2,2,1,3,2,2,2,2,1,2,1,2,2,2,
%T 2,3,1,2,2,3,1,2,1,2,2,2,1,2,2,2,2,2,1,3,2,3,2,2,1,3,1,2,2,3,2,2,1,2,
%U 2,2,1,2,1,2,2,2,2,2,1,2,3,2,1,3,2,2,2,3,1,3,2,2,2,2,2,3,1,2,2,3,1,2,1,3,2
%N Number of iterations needed to reach 1 under the map n -> Omega(n).
%H Charles R Greathouse IV, <a href="/A036430/b036430.txt">Table of n, a(n) for n = 1..10000</a>
%F a(n) = a(bigomega(n)) + 1 for n > 1. - _Vladeta Jovovic_, Jul 10 2004
%F a(n) = O(log* n). - _Charles R Greathouse IV_, Apr 25 2012
%e 16 -> 4 -> 2 -> 1 and thus a(16) = 3.
%o (PARI) a(n)=my(s);while(n>1,n=bigomega(n);s++);s \\ _Charles R Greathouse IV_, Apr 25 2012
%Y Cf. A029908, A073855.
%K nonn,easy
%O 1,4
%A _Dann Toliver_
%E Corrected and extended by Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Apr 21 2003
%E Formula corrected by _Charles R Greathouse IV_, Apr 25 2012