The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 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 Cf. A001223, A006530, A081413, A000230. Sequence in context: A352201 A052298 A179938 * A082863 A278950 A029411 Adjacent sequences: A081409 A081410 A081411 * A081413 A081414 A081415 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.

Last modified December 9 23:05 EST 2022. Contains 358710 sequences. (Running on oeis4.)