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”).
%I #23 Jan 04 2016 20:30:24
%S 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,
%T 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,
%U 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
%N a(n) = sum of exponents in prime-power factorization of prime(n) + 1.
%H Paolo P. Lava, <a href="/A023514/b023514.txt">Table of n, a(n) for n = 1..10000</a>
%F a(n) = A001222(A000040(n)+1). - _Zak Seidov_, Jan 04 2016
%p with(numtheory):
%p a:= n-> add(i[2], i=ifactors(ithprime(n)+1)[2]):
%p seq(a(n), n=1..100);
%t Array[Plus@@Last/@FactorInteger[Prime[ # ]+1]&,6! ] (* _Vladimir Joseph Stephan Orlovsky_, Feb 28 2010 *)
%o (PARI) a(n) = bigomega(prime(n)+1); \\ _Michel Marcus_, Jan 04 2016
%Y Cf. A210934.
%Y Cf. A000040, A001222.
%K nonn
%O 1,2
%A _Clark Kimberling_