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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A066977 a(n) = gcd(prime(n^2) + 1, prime(n) + 1). 1

%I

%S 3,4,6,2,2,2,6,4,12,2,2,2,2,2,12,54,20,2,2,6,2,2,12,18,2,6,8,4,2,2,2,

%T 22,2,2,2,4,2,2,24,6,36,2,2,2,6,2,4,2,4,2,18,120,2,6,2,6,6,8,2,2,2,14,

%U 2,6,2,2,4,2,6,2,6,72,2,2,2,24,10,2,6,10,84,2,6,2,22,6,2,2,2,4,6,16

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

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

%o (PARI) { default(primelimit, 4294965247); for (n=1, 1000, write("b066977.txt", n, " ", gcd(prime(n^2) + 1, prime(n) + 1)) ) } \\ _Harry J. Smith_, Apr 12 2010

%K nonn

%O 1,1

%A _Benoit Cloitre_, Jan 26 2002

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.

Last modified June 20 06:56 EDT 2021. Contains 345157 sequences. (Running on oeis4.)