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!)
A345301 a(n) = Sum_{p|n, p prime} p^pi(n/p). 4
0, 1, 1, 2, 1, 7, 1, 4, 9, 13, 1, 17, 1, 23, 52, 16, 1, 43, 1, 41, 130, 43, 1, 113, 125, 77, 81, 113, 1, 270, 1, 64, 364, 145, 968, 371, 1, 275, 898, 881, 1, 1328, 1, 377, 1354, 535, 1, 1241, 2401, 1137, 2476, 681, 1, 2699, 4456, 2913, 6922, 1053, 1, 10710, 1, 2079, 8962 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
COMMENTS
If p is prime, a(p) = Sum_{p|p} p^pi(p/p) = p^0 = 1.
LINKS
EXAMPLE
a(12) = Sum_{p|12} p^pi(12/p) = 2^pi(6) + 3^pi(4) = 2^3 + 3^2 = 17.
MATHEMATICA
Table[Sum[k^PrimePi[n/k] (PrimePi[k] - PrimePi[k - 1]) (1 - Ceiling[n/k] + Floor[n/k]), {k, n}], {n, 80}]
PROG
(Python)
from sympy import primefactors, primepi
def A345301(n): return sum(p**primepi(n//p) for p in primefactors(n)) # Chai Wah Wu, Jun 13 2021
CROSSREFS
Cf. A000720.
Sequence in context: A178211 A305564 A354873 * A160417 A117044 A280691
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 25 07:53 EDT 2024. Contains 371964 sequences. (Running on oeis4.)