Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #7 Mar 17 2019 21:07:29
%S 0,1,2,1,3,2,4,1,2,3,5,2,6,2,2,2,7,3,8,2,4,2,9,2,3,3,2,2,10,1,11,1,4,
%T 3,3,2,12,2,2,3,13,3,14,2,2,3,15,2,4,5,6,2,16,4,5,2,2,5,17,3,18,5,4,3,
%U 6,2,19,3,4,3,20,2,21,3,3,4,4,2,22,2,2,6,23,5,3,4,4,4,24,4,4,3,6,6,4,4,25,4,2,2,26,4,27,2,2
%N a(n) = A000120(A323243(n)).
%H Antti Karttunen, <a href="/A324729/b324729.txt">Table of n, a(n) for n = 1..10000</a> (based on Hans Havermann's factorization of A156552)
%H <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%H <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%H <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%F a(n) = A000120(A323243(n)).
%F a(A000040(n)) = n.
%o (PARI) A324729(n) = hammingweight(A323243(n)); \\ Needs also code from A323243.
%Y Cf. A000120, A323243, A324730.
%K nonn
%O 1,3
%A _Antti Karttunen_, Mar 17 2019