login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A023580
Sum of distinct prime divisors of prime(n)+3.
0
5, 5, 2, 7, 9, 2, 7, 13, 15, 2, 19, 7, 13, 25, 7, 9, 33, 2, 14, 39, 21, 43, 45, 25, 7, 15, 55, 18, 9, 31, 20, 69, 14, 73, 21, 20, 7, 85, 24, 13, 22, 25, 99, 9, 7, 103, 109, 115, 30, 31, 61, 13, 63, 129, 20, 28, 19, 139, 14, 73, 26, 39, 38, 159, 81, 7, 169, 24, 14
OFFSET
1,1
FORMULA
a(n) = A008472(A113935(n)). - Michel Marcus, May 05 2021
MATHEMATICA
Total[First/@FactorInteger[#]]&/@(Prime@Range@100+3) (* Giorgos Kalogeropoulos, May 05 2021 *)
PROG
(Python)
from sympy import primefactors, prime
def a(n): return sum(primefactors(prime(n) + 3))
print([a(n) for n in range(1, 70)]) # Michael S. Branicky, May 05 2021
CROSSREFS
Sequence in context: A153839 A378204 A322159 * A021648 A287746 A377804
KEYWORD
nonn
STATUS
approved