The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A152057 Sum of the distinct prime factors of 2^n-1. 2
 0, 0, 3, 7, 8, 31, 10, 127, 25, 80, 45, 112, 28, 8191, 173, 189, 282, 131071, 102, 524287, 91, 471, 798, 178528, 286, 2433, 10925, 262737, 320, 3425, 534, 2147483647, 65819, 599598, 174765, 123150, 266, 616318400, 699053, 129646, 61789, 164524720, 5936 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Robert Israel, Table of n, a(n) for n = 0..500 FORMULA a(n) = A008472(A000225(n)). - Robert Israel, Jan 14 2021 MAPLE sopf:= n -> convert(numtheory:-factorset(n), `+`): seq(sopf(2^n-1), n=0..100); # Robert Israel, Jan 14 2021 MATHEMATICA Table[Sum[FactorInteger[2^n - 1][[m]][[1]], {m, 1, Length[FactorInteger[2^n - 1]]}], {n, 0, 50}] CROSSREFS Cf. A000225, A008472, A046800, A075708. Row sums of A060443. Sequence in context: A152486 A301523 A105756 * A177689 A191611 A281678 Adjacent sequences:  A152054 A152055 A152056 * A152058 A152059 A152060 KEYWORD nonn AUTHOR Roger L. Bagula, Nov 22 2008 EXTENSIONS Edited by N. J. A. Sloane, Nov 26 2008 STATUS approved

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

Last modified June 14 20:21 EDT 2021. Contains 345038 sequences. (Running on oeis4.)