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

A023514
a(n) = sum of exponents in prime-power factorization of prime(n) + 1.
8
1, 2, 2, 3, 3, 2, 3, 3, 4, 3, 5, 2, 3, 3, 5, 4, 4, 2, 3, 5, 2, 5, 4, 4, 3, 3, 4, 5, 3, 3, 7, 4, 3, 4, 4, 4, 2, 3, 5, 3, 5, 3, 7, 2, 4, 5, 3, 6, 4, 3, 4, 6, 3, 5, 3, 5, 5, 5, 2, 3, 3, 4, 4, 5, 2, 3, 3, 3, 4, 4, 3, 6, 5, 3, 4, 8, 4, 2, 3, 3, 5, 2, 7, 3, 5, 4, 5, 2, 4, 5, 5, 7, 4, 4, 5, 6, 4, 4, 3
OFFSET
1,2
LINKS
FORMULA
a(n) = A001222(A000040(n)+1). - Zak Seidov, Jan 04 2016
MAPLE
with(numtheory):
a:= n-> add(i[2], i=ifactors(ithprime(n)+1)[2]):
seq(a(n), n=1..100);
MATHEMATICA
Array[Plus@@Last/@FactorInteger[Prime[ # ]+1]&, 6! ] (* Vladimir Joseph Stephan Orlovsky, Feb 28 2010 *)
PROG
(PARI) a(n) = bigomega(prime(n)+1); \\ Michel Marcus, Jan 04 2016
CROSSREFS
Cf. A210934.
Sequence in context: A233542 A375802 A245908 * A179751 A373888 A039645
KEYWORD
nonn
STATUS
approved