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”).

A210934
Sum of prime factors of prime(n)+1 (counted with multiplicity).
5
3, 4, 5, 6, 7, 9, 8, 9, 9, 10, 10, 21, 12, 15, 11, 11, 12, 33, 21, 12, 39, 13, 14, 13, 16, 22, 19, 13, 18, 24, 14, 18, 28, 16, 15, 25, 81, 45, 16, 34, 15, 22, 15, 99, 19, 16, 57, 17, 26, 30, 21, 16, 24, 17, 48, 20, 16, 25, 141, 52, 75, 19, 22, 22, 159, 58, 87
OFFSET
1,1
COMMENTS
From an idea of Michael B. Porter.
LINKS
FORMULA
a(n) = A001414(A008864(n)). - Michel Marcus, Oct 05 2013
EXAMPLE
prime(8) = 19, and 19+1 = 20 = 2*2*5, so a(8) = 2+2+5 = 9.
MAPLE
with(numtheory);
P:=proc(i)
local a, k, n;
for n from 1 to i do
a:=ifactors(ithprime(n)+1)[2]; print(add(a[k][1]*a[k][2], k=1..nops(a)));
od; end:
# alternative
A210934 := proc(n)
local p, pplus, f ;
p := ithprime(n) ;
pplus := ifactors(p+1)[2] ;
add(op(1, f)*op(2, f), f=pplus) ;
end proc:
seq(A210934(n), n=1..300) ; # R. J. Mathar, May 25 2022
CROSSREFS
KEYWORD
nonn
AUTHOR
Paolo P. Lava, Mar 30 2012
STATUS
approved

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy