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

%I #8 Mar 19 2023 09:08:30

%S 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,

%T 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,

%U 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

%N GCD of (n + prime(n)) and (n + 1 + prime(n+1)).

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

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

%t GCD@@#&/@Partition[Table[n+Prime[n],{n,150}],2,1] (* _Harvey P. Dale_, Mar 19 2023 *)

%Y Cf. A014688.

%K nonn

%O 1,7

%A _Zak Seidov_, May 20 2005

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 September 14 21:48 EDT 2024. Contains 375929 sequences. (Running on oeis4.)