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

5, 6, 8, 18, 15, 15, 17, 39, 29, 86, 23, 35, 25, 22, 33, 68, 26, 31, 46, 32, 37, 24, 35, 23, 45, 100, 78, 51, 39, 45, 44, 33, 35, 45, 98, 34, 45, 141, 147, 67, 25, 43, 236, 25, 29, 75, 150, 29, 76, 125, 160, 26, 121, 122, 73, 37, 52, 56, 40, 39, 54, 58, 239, 69, 36, 39

Offset

1,1

Links

Amiram Eldar, Table of n, a(n) for n = 1..10000

Example

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

Crossrefs

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

Sequence in context: A110461 A242913 A191212 * A054378 A129319 A362285

Adjacent sequences: A129315 A129316 A129317 * A129319 A129320 A129321

Keyword

easy,nonn

Author

Walter Kehowski, Apr 09 2007, corrected Apr 09 2007

Status

approved