The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A063086 a(n) = gcd(1 + prime(n+1), 1 + prime(n)). 2
 1, 2, 2, 4, 2, 2, 2, 4, 6, 2, 2, 2, 2, 4, 6, 6, 2, 2, 4, 2, 2, 4, 6, 2, 2, 2, 4, 2, 2, 2, 4, 6, 2, 10, 2, 2, 2, 4, 6, 6, 2, 2, 2, 2, 2, 4, 4, 4, 2, 2, 6, 2, 2, 6, 6, 6, 2, 2, 2, 2, 2, 14, 4, 2, 2, 2, 2, 2, 2, 2, 6, 8, 2, 2, 4, 6, 2, 2, 2, 10, 2, 2, 2, 2, 4, 6, 2, 2, 2, 4, 12, 8, 4, 4, 4, 6, 6, 2, 2, 2, 2, 6 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Harry J. Smith, Table of n, a(n) for n = 1..1000 EXAMPLE n=34: gcd(1 + 139, 1 + 149) = 10 = a(34). MATHEMATICA GCD[First[#]+1, Last[#]+1]&/@ Partition[Prime[Range[110]], 2, 1] (* Harvey P. Dale, May 02 2012 *) PROG (PARI) a(n)={gcd(1 + prime(n+1), 1 + prime(n))} \\ Harry J. Smith, Aug 17 2009 CROSSREFS Cf. A058263. Sequence in context: A094818 A114233 A279047 * A077636 A215847 A057000 Adjacent sequences:  A063083 A063084 A063085 * A063087 A063088 A063089 KEYWORD easy,nonn AUTHOR Labos Elemer, Aug 06 2001 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 28 18:42 EDT 2021. Contains 347717 sequences. (Running on oeis4.)