%I A136566
%S A136566 0,1,1,2,1,0,1,3,2,0,1,3,1,0,0,4,1,3,1,3,0,0,1,4,2,0,3,3,1,0,1,5,0,0,0,
%T A136566 0,1,0,0,4,1,0,1,3,3,0,1,5,2,3,0,3,1,4,0,4,0,0,1,2,1,0,3,6,0,0,1,3,0,0,
%U A136566 1,5,1,0,3,3,0,0,1,5,4,0,1,2,0,0,0,4,1,2,0,3,0,0,0,6,1,3,3,0,1,0,1,4,0
%N A136566 a(n) = sum of the exponents occurring only once each in the prime-factorization 
               of n.
%H A136566 Diana Mecum, <a href="b136566.txt">Table of n, a(n) for n = 1..1000</
               a>
%H A136566 Leroy Quet, <a href="http://www.prism-of-spirals.net/">Home Page</a> 
               (listed in lieu of email address)
%e A136566 4200 = 2^3 * 3^1 * 5^2 * 7^1. The exponents of the prime factorization 
               are therefore 3,1,2,1. The exponents occurring exactly once are 2 
               and 3. So a(4200) = 2+3 = 5.
%Y A136566 Cf. A136565, A136567.
%Y A136566 Sequence in context: A047265 A100995 A129353 this_sequence A048983 A118344 
               A119270
%Y A136566 Adjacent sequences: A136563 A136564 A136565 this_sequence A136567 A136568 
               A136569
%K A136566 nonn
%O A136566 1,4
%A A136566 Leroy Quet, Jan 07 2008
%E A136566 More terms from Diana Mecum (diana.mecum(AT)gmail.com), Jul 17 2008