%I #33 Apr 24 2022 07:40:41
%S 1,2,4,5,3,6,7,6,7,5,8,8,9,7,10,9,8,9,13,11,14,9,10,10,12,11,15,13,16,
%T 10,10,19,17,20,12,21,19,22,11,11,15,25,23,26,11,12,17,11,13,14,13,12,
%U 16,18,14,31,29
%N a(n) = p_1 + p_2 + ... + p_k, where p_1*p_2*...*p_k is the prime factorization of A064413(n).
%H Peter Kagey, <a href="/A276127/b276127.txt">Table of n, a(n) for n = 1..10000</a>
%F a(1) = 1
%F a(n) = A001414(A064413(n)) for n > 1. - _Peter Kagey_, Sep 15 2016
%e For instance, a(4) = 5 because A064413(4) = 6, and 6 = 2*3; 2 + 3 = 5.
%o (Haskell)
%o a276127 1 = 1
%o a276127 n = a001414 $ a064413 n -- _Peter Kagey_, Sep 15 2016
%Y Cf. A001414, A064413.
%K nonn,easy
%O 1,2
%A _Alec Jones_, Sep 05 2016