%I A036430
%S A036430 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,2,
%T A036430 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,2,2,
%U A036430 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 A036430 Let b(0)=n, b(i)=# of prime factors of b(i-1); then a(n)=i such that 
               b(i)=1.
%F A036430 a(n)=1+a(bigomega(n)). - Vladeta Jovovic (vladeta(AT)eunet.rs), Jul 10 
               2004
%e A036430 Let b(0) = 16, then b(1) = 4 and b(2) = 2, then b(3) = 1, hence a(16)=3.
%Y A036430 Cf. A029908, A073855.
%Y A036430 Sequence in context: A072491 A051034 A082477 this_sequence A163377 A163109 
               A128428
%Y A036430 Adjacent sequences: A036427 A036428 A036429 this_sequence A036431 A036432 
               A036433
%K A036430 nonn,easy
%O A036430 1,4
%A A036430 Dann Toliver (fsdrt(AT)hotmail.com)
%E A036430 Corrected and extended by Antonio G. Astudillo (afg_astudillo(AT)lycos.com), 
               Apr 21 2003