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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A107294 GCD of (n + prime(n)) and (n + 1 + prime(n+1)). 0
1, 1, 1, 1, 1, 1, 3, 1, 1, 3, 7, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 3, 1, 1, 3, 1, 1, 1, 1, 1, 7, 1, 1, 1, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 5, 1, 1, 1, 1, 5, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,7

LINKS

Table of n, a(n) for n=1..105.

EXAMPLE

a(139) = 13 because {(139 + prime(139)), (140 + prime(140))} = {936, 949} ={13*72,13*73}.

MATHEMATICA

Table[GCD[n+Prime[n], n+1+Prime[n+1]], {n, 150}]

CROSSREFS

Cf. A014688.

Sequence in context: A089312 A246674 A058735 * A161788 A170819 A140211

Adjacent sequences:  A107291 A107292 A107293 * A107295 A107296 A107297

KEYWORD

nonn

AUTHOR

Zak Seidov, May 20 2005

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 14 01:49 EDT 2021. Contains 342941 sequences. (Running on oeis4.)