login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066940 Numbers n such that gcd(prime(n+1) + 1, prime(n) + 1) = 2. 9
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; text; internal format)
OFFSET
1,1
LINKS
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)) ) } \\ Harry J. Smith, Apr 09 2010
CROSSREFS
Sequence in context: A107746 A024899 A114518 * A305318 A100118 A295389
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Jan 24 2002
EXTENSIONS
Edited by Robert G. Wilson v, Feb 01 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 12:06 EDT 2024. Contains 371792 sequences. (Running on oeis4.)