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!)
A063086 a(n) = gcd(1 + prime(n+1), 1 + prime(n)). 2

%I

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

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

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

%N a(n) = gcd(1 + prime(n+1), 1 + prime(n)).

%H Harry J. Smith, <a href="/A063086/b063086.txt">Table of n, a(n) for n = 1..1000</a>

%e n=34: gcd(1 + 139, 1 + 149) = 10 = a(34).

%t GCD[First[#]+1,Last[#]+1]&/@ Partition[Prime[Range[110]],2,1] (* _Harvey P. Dale_, May 02 2012 *)

%o (PARI) a(n)={gcd(1 + prime(n+1), 1 + prime(n))} \\ _Harry J. Smith_, Aug 17 2009

%Y Cf. A058263.

%K easy,nonn

%O 1,2

%A _Labos Elemer_, Aug 06 2001

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 October 16 12:47 EDT 2021. Contains 348041 sequences. (Running on oeis4.)