login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
OFFSET
1,7
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