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!)
A023581 Sum of exponents in prime-power factorization of p(n)+3. 1

%I #11 Sep 08 2022 08:44:47

%S 1,2,3,2,2,4,3,2,2,5,2,4,3,2,3,4,2,6,3,2,3,2,2,3,4,4,2,3,5,3,3,2,4,2,

%T 4,3,6,2,3,5,3,4,2,4,5,2,2,2,3,4,3,3,3,2,4,3,5,2,5,3,3,4,3,2,3,7,2,4,

%U 4,6,3,2,3,4,2,2,5,6,3,3,2,4,3,3,3,2,3,4,5,2,3,2,4,3,2,3,9,3,2

%N Sum of exponents in prime-power factorization of p(n)+3.

%H G. C. Greubel, <a href="/A023581/b023581.txt">Table of n, a(n) for n = 1..10000</a>

%F a(n) = A001222(A113935(n)). - _Michel Marcus_, Sep 30 2013

%t Table[PrimeOmega[3 + Prime[n]], {n, 1, 100}] (* _G. C. Greubel_, May 21 2019 *)

%o (PARI) a(n) = bigomega(prime(n) + 3); \\ _Michel Marcus_, Sep 30 2013

%o (Magma) [n eq 1 select 1 else (&+[p[2]: p in Factorization(NthPrime(n) + 3)]): n in [1..100]]; // _G. C. Greubel_, May 21 2019

%o (Sage) [sloane.A001222(nth_prime(n)+3) for n in (1..100)] # _G. C. Greubel_, May 21 2019

%K nonn

%O 1,2

%A _Clark Kimberling_

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 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)