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!)
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
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}]
GCD@@#&/@Partition[Table[n+Prime[n], {n, 150}], 2, 1] (* Harvey P. Dale, Mar 19 2023 *)
CROSSREFS
Cf. A014688.
Sequence in context: A246674 A363340 A058735 * A161788 A345468 A351518
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 12:14 EDT 2024. Contains 371792 sequences. (Running on oeis4.)