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
 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, 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, 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Harry J. Smith, Table of n, a(n) for n = 1..1000 PROG (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 CROSSREFS Sequence in context: A246859 A122601 A125776 * A007551 A161012 A065446 Adjacent sequences:  A066974 A066975 A066976 * A066978 A066979 A066980 KEYWORD nonn AUTHOR Benoit Cloitre, Jan 26 2002 STATUS approved

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 May 5 19:23 EDT 2021. Contains 343573 sequences. (Running on oeis4.)