This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A276127 #33 Apr 24 2022 07:40:41 %S A276127 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 A276127 10,10,19,17,20,12,21,19,22,11,11,15,25,23,26,11,12,17,11,13,14,13,12, %U A276127 16,18,14,31,29 %N A276127 a(n) = p_1 + p_2 + ... + p_k, where p_1*p_2*...*p_k is the prime factorization of A064413(n). %H A276127 Peter Kagey, <a href="/A276127/b276127.txt">Table of n, a(n) for n = 1..10000</a> %F A276127 a(1) = 1 %F A276127 a(n) = A001414(A064413(n)) for n > 1. - _Peter Kagey_, Sep 15 2016 %e A276127 For instance, a(4) = 5 because A064413(4) = 6, and 6 = 2*3; 2 + 3 = 5. %o A276127 (Haskell) %o A276127 a276127 1 = 1 %o A276127 a276127 n = a001414 $ a064413 n -- _Peter Kagey_, Sep 15 2016 %Y A276127 Cf. A001414, A064413. %K A276127 nonn,easy %O A276127 1,2 %A A276127 _Alec Jones_, Sep 05 2016