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!)
A333808 Sum of distinct prime divisors of n that are < sqrt(n). 5
0, 0, 0, 0, 0, 2, 0, 2, 0, 2, 0, 5, 0, 2, 3, 2, 0, 5, 0, 2, 3, 2, 0, 5, 0, 2, 3, 2, 0, 10, 0, 2, 3, 2, 5, 5, 0, 2, 3, 7, 0, 5, 0, 2, 8, 2, 0, 5, 0, 7, 3, 2, 0, 5, 5, 9, 3, 2, 0, 10, 0, 2, 10, 2, 5, 5, 0, 2, 3, 14, 0, 5, 0, 2, 8, 2, 7, 5, 0, 7, 3, 2, 0, 12, 5, 2, 3, 2, 0, 10 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,6
LINKS
FORMULA
G.f.: Sum_{k>=1} prime(k) * x^(prime(k)*(prime(k) + 1)) / (1 - x^prime(k)).
MATHEMATICA
Table[DivisorSum[n, # &, # < Sqrt[n] && PrimeQ[#] &], {n, 1, 90}]
nmax = 90; CoefficientList[Series[Sum[Prime[k] x^(Prime[k] (Prime[k] + 1))/(1 - x^Prime[k]), {k, 1, nmax}], {x, 0, nmax}], x] // Rest
CROSSREFS
Sequence in context: A137899 A369382 A293516 * A307692 A300548 A293898
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Apr 05 2020
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 18 21:51 EDT 2024. Contains 371781 sequences. (Running on oeis4.)