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!)
A081412 Largest prime divisors of differences between consecutive primes. 1
2, 2, 2, 2, 2, 2, 2, 3, 2, 3, 2, 2, 2, 3, 3, 2, 3, 2, 2, 3, 2, 3, 2, 2, 2, 2, 2, 2, 7, 2, 3, 2, 5, 2, 3, 3, 2, 3, 3, 2, 5, 2, 2, 2, 3, 3, 2, 2, 2, 3, 2, 5, 3, 3, 3, 2, 3, 2, 2, 5, 7, 2, 2, 2, 7, 3, 5, 2, 2, 3, 2, 3, 3, 2, 3, 2, 2, 2, 5, 2, 5, 2, 3, 2, 3, 2, 2, 2, 2, 3, 2, 2, 2, 2, 3, 3, 2, 3, 3, 5, 3, 3, 2, 3, 5 (list; graph; refs; listen; history; text; internal format)
OFFSET
2,1
COMMENTS
If a(n)=2, then corresponding prime-difference is a power of 2.
a(n)=2 for twin-prime differences.
LINKS
FORMULA
a(n) = A006530(A001223(n)).
MATHEMATICA
Table[FactorInteger[Prime[w+1]-Prime[w]][[ -1, 1]], {w, 2, 256}]
FactorInteger[#][[-1, 1]]&/@Differences[Prime[Range[2, 110]]] (* Harvey P. Dale, Sep 24 2017 *)
PROG
(PARI) a(n) = vecmax(factor(prime(n+1)-prime(n))[, 1]); \\ Michel Marcus, Mar 27 2020
CROSSREFS
Sequence in context: A052298 A366441 A179938 * A082863 A278950 A029411
KEYWORD
nonn
AUTHOR
Labos Elemer, Apr 02 2003
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 March 28 17:25 EDT 2024. Contains 371254 sequences. (Running on oeis4.)