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!)
A345299 a(n) = Sum_{p|n} p^pi(p). 1
0, 2, 9, 2, 125, 11, 2401, 2, 9, 127, 161051, 11, 4826809, 2403, 134, 2, 410338673, 11, 16983563041, 127, 2410, 161053, 1801152661463, 11, 125, 4826811, 9, 2403, 420707233300201, 136, 25408476896404831, 2, 161060, 410338675, 2526, 11, 6582952005840035281, 16983563043 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(p) = p^pi(p) for p prime.
EXAMPLE
a(10) = Sum_{p|10} p^pi(p) = 2^1 + 5^3 = 127.
MATHEMATICA
Table[Sum[k^PrimePi[k] (PrimePi[k] - PrimePi[k - 1]) (1 - Ceiling[n/k] + Floor[n/k]), {k, n}], {n, 50}]
PROG
(Python)
from sympy import primefactors, primepi
def A345299(n): return sum(p**primepi(p) for p in primefactors(n)) # Chai Wah Wu, Jun 13 2021
CROSSREFS
Sequence in context: A248433 A091943 A318511 * A276048 A339203 A179451
KEYWORD
nonn
AUTHOR
Wesley Ivan Hurt, Jun 13 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 22:36 EDT 2024. Contains 371917 sequences. (Running on oeis4.)