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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A349555 a(n) = Sum_{p<=n, p prime} p^floor(1/gcd(n/p)). 0
 0, 1, 3, 4, 6, 7, 11, 16, 15, 12, 18, 25, 29, 34, 35, 40, 42, 55, 59, 72, 69, 66, 78, 97, 96, 87, 98, 93, 101, 122, 130, 159, 148, 143, 150, 157, 161, 178, 183, 192, 198, 229, 239, 270, 275, 258, 282, 325, 322, 323, 310, 315, 329, 378, 367, 374, 361, 352, 382, 433, 441, 470 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS For each prime number p less than or equal to n, add 1 if p|n, otherwise add p (see example). LINKS FORMULA a(n) = A001221(n) + A066911(n). EXAMPLE a(9) = 15; The primes less than or equal to 9 are 2, 3, 5, 7 and only 3|9. We then have, respectively, a(9) = 2 + 1 + 5 + 7 = 15. MATHEMATICA nterms=100; Table[Total[Map[If[Mod[n, #]==0, 1, #]&, Prime[Range[PrimePi[n]]]]], {n, nterms}] (* Paolo Xausa, Nov 22 2021 *) CROSSREFS Cf. A001221, A066911. Sequence in context: A085253 A207525 A240208 * A073906 A108797 A089161 Adjacent sequences: A349552 A349553 A349554 * A349556 A349557 A349558 KEYWORD nonn AUTHOR Wesley Ivan Hurt, Nov 21 2021 STATUS approved

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.

Last modified February 3 09:09 EST 2023. Contains 360034 sequences. (Running on oeis4.)