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!)
A023510 Greatest exponent in prime-power factorization of prime(n) + 1. 1
1, 2, 1, 3, 2, 1, 2, 2, 3, 1, 5, 1, 1, 2, 4, 3, 2, 1, 2, 3, 1, 4, 2, 2, 2, 1, 3, 3, 1, 1, 7, 2, 1, 2, 2, 3, 1, 2, 3, 1, 2, 1, 6, 1, 2, 3, 2, 5, 2, 1, 2, 4, 2, 2, 1, 3, 3, 4, 1, 1, 2, 2, 2, 3, 1, 1, 2, 2, 2, 2, 1, 3, 4, 1, 2, 7, 1, 1, 1, 1, 2, 1, 4, 1, 3, 2, 2, 1, 1, 4, 2, 5, 3, 2, 3, 3, 1, 2, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
If a(n)=1 then prime(a(n)) is a term in A049097. - Zak Seidov, Jul 20 2016
LINKS
FORMULA
a(n) = A051903(A008864(n)). - Michel Marcus, Jul 20 2016
EXAMPLE
For n=5, the fifth prime is 11, and the prime factorization of 11 + 1 = 12 is 2^2*3. This has exponents 2 and 1, so a(5) is the largest of these exponents, 2. - Michael B. Porter, Jul 20 2016
MATHEMATICA
Table[Max[#[[2]] & /@ FactorInteger[Prime[k] + 1]], {k, 10000}] (* Zak Seidov, Jul 19 2016 *)
PROG
(PARI) a(n) = vecmax(factor(prime(n)+1)[, 2]) \\ Michel Marcus, Jul 20 2016
CROSSREFS
Sequence in context: A089209 A153359 A240474 * A005678 A296976 A182321
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 April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)