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

 

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

%I #10 Oct 26 2019 09:58:04

%S 5,6,8,18,15,30,34,78,29,86,115,525,50,110,33,204,286,62,506,32,185,

%T 120,35,92,180,100,390,102,624,450,44,198,455,180,294,306,45,141,882,

%U 134,650,86,708,575,116,75,150,174,152,375,160,286,242,122,584,518,1456,448

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

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

%e a(6)=30 since sopfr(A129317(6))=sopfr(161)=sopfr(7*23)=30.

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

%K easy,nonn

%O 1,1

%A _Walter Kehowski_, Apr 09 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | 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 April 23 06:04 EDT 2024. Contains 371906 sequences. (Running on oeis4.)