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!)
 A057467 GCD of n-th and (n+1)-st term in the sequence of first differences between primes, A001223. 6
 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 6, 2, 2, 2, 2, 2, 2, 2, 2, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 6, 2, 2, 6, 2, 2, 2, 2, 2, 2, 12, 4, 2, 2, 2, 2, 2, 2, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 6, 2, 2, 2, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 4, 2, 2, 4, 4, 4, 4, 4, 2, 6, 2, 2, 6, 2, 2, 6, 2, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS FORMULA a(n) = gcd( A001223(n+1), A001223(n) ). MATHEMATICA Map[GCD @@ # &, Partition[#, 2, 1] &@ Differences@ Prime@ Range@ 100] (* Michael De Vlieger, Feb 18 2017 *) CROSSREFS Cf. A001223. Sequence in context: A135663 A090620 A151659 * A074594 A211667 A001069 Adjacent sequences: A057464 A057465 A057466 * A057468 A057469 A057470 KEYWORD nonn,easy AUTHOR Labos Elemer, Dec 06 2000 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 17:46 EST 2022. Contains 358703 sequences. (Running on oeis4.)