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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066940 GCD(prime(n+1)+1, prime(n)+1)=2. 7
2, 3, 5, 6, 7, 10, 11, 12, 13, 17, 18, 20, 21, 24, 25, 26, 28, 29, 30, 33, 35, 36, 37, 41, 42, 43, 44, 45, 49, 50, 52, 53, 57, 58, 59, 60, 61, 64, 65, 66, 67, 68, 69, 70, 73, 74, 77, 78, 79, 81, 82, 83, 84, 87, 88, 89, 98, 99, 100, 101, 104, 105, 106, 109, 110, 111, 112, 113 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

LINKS

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

MATHEMATICA

Select[ Range[120], GCD[ Prime[ # + 1] + 1, Prime[ # ] + 1] == 2 & ]

PROG

(PARI) { n=0; for (m=1, 10^10, if (gcd(prime(m+1) + 1, prime(m) + 1) == 2, write("b066940.txt", n++, " ", m); if (n==1000, return)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Apr 09 2010]

CROSSREFS

Cf. A066941, A066942, A066943, A066944, A067603, A067604.

Sequence in context: A107746 A024899 A114518 * A100118 A028781 A136149

Adjacent sequences:  A066937 A066938 A066939 * A066941 A066942 A066943

KEYWORD

nonn

AUTHOR

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

EXTENSIONS

Edited by Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 01 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 10:39 EST 2012. Contains 205904 sequences.