login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A129318 a(n) = sopfr(A129316(n)), where sopfr(x) is the sum of the prime factors of x, counting multiplicity. 5

%I #10 Oct 26 2019 09:57:57

%S 5,6,8,18,15,15,17,39,29,86,23,35,25,22,33,68,26,31,46,32,37,24,35,23,

%T 45,100,78,51,39,45,44,33,35,45,98,34,45,141,147,67,25,43,236,25,29,

%U 75,150,29,76,125,160,26,121,122,73,37,52,56,40,39,54,58,239,69,36,39

%N a(n) = sopfr(A129316(n)), where sopfr(x) is the sum of the prime factors of x, counting multiplicity.

%H Amiram Eldar, <a href="/A129318/b129318.txt">Table of n, a(n) for n = 1..10000</a>

%e a(6)=15 since sopfr(A129316(6))=sopfr(160)=sopfr(2^5*5)=15.

%Y Cf. A001414, A006145, A039752, A129316, A129317, A129319, A129320.

%K easy,nonn

%O 1,1

%A _Walter Kehowski_, Apr 09 2007, corrected Apr 09 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 19 01:02 EDT 2024. Contains 376002 sequences. (Running on oeis4.)