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!)
A023577 Greatest exponent in prime-power factorization of prime(n)+3. 1

%I #7 Mar 19 2019 00:02:30

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

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

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

%N Greatest exponent in prime-power factorization of prime(n)+3.

%H Robert Israel, <a href="/A023577/b023577.txt">Table of n, a(n) for n = 1..10000</a>

%F a(n) = A051903(3+A000040(n)). - _Robert Israel_, Mar 18 2019

%p f:= proc(n) max(map(t -> t[2], ifactors(ithprime(n)+3)[2])) end proc:

%p map(f, [$1..100]); # _Robert Israel_, Mar 18 2019

%Y Cf. A000040, A051903.

%K nonn

%O 1,3

%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 September 3 04:27 EDT 2024. Contains 375649 sequences. (Running on oeis4.)