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
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, 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, 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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
FORMULA
a(n) = A051903(3+A000040(n)). - Robert Israel, Mar 18 2019
MAPLE
f:= proc(n) max(map(t -> t[2], ifactors(ithprime(n)+3)[2])) end proc:
map(f, [$1..100]); # Robert Israel, Mar 18 2019
CROSSREFS
Sequence in context: A264490 A299794 A023579 * A188139 A134557 A290342
KEYWORD
nonn
AUTHOR
STATUS
approved

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 July 28 18:12 EDT 2024. Contains 374726 sequences. (Running on oeis4.)