login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066978 Gcd(prime(2n)+1, prime(n)+1). 1
1, 4, 2, 4, 6, 2, 2, 2, 2, 6, 16, 2, 6, 4, 6, 6, 20, 2, 4, 6, 2, 2, 4, 2, 2, 6, 4, 12, 2, 6, 2, 12, 6, 2, 50, 8, 2, 4, 2, 2, 2, 14, 12, 2, 2, 40, 4, 56, 6, 2, 18, 30, 2, 18, 86, 2, 10, 2, 2, 6, 2, 6, 2, 24, 2, 6, 2, 2, 4, 10, 6, 36, 8, 22, 4, 6, 6, 2, 6, 2, 6, 2, 24, 2, 2, 2, 2, 2, 6, 2, 156, 6, 2, 4 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

LINKS

Harry J. Smith, Table of n, a(n) for n=1,...,1000

PROG

(PARI) { for (n=1, 1000, write("b066978.txt", n, " ", gcd(prime(2*n) + 1, prime(n) + 1)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Apr 13 2010]

CROSSREFS

Sequence in context: A167508 A167507 A007005 * A114566 A013679 A096428

Adjacent sequences:  A066975 A066976 A066977 * A066979 A066980 A066981

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Jan 26 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 05:32 EST 2012. Contains 205860 sequences.