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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066941 GCD(prime(n+1)+1, prime(n)+1)=4. 7
4, 8, 14, 19, 22, 27, 31, 38, 46, 47, 48, 63, 75, 85, 90, 93, 94, 95, 114, 117, 124, 131, 143, 149, 153, 154, 155, 163, 181, 192, 207, 213, 224, 229, 232, 235, 241, 242, 247, 248, 249, 261, 276, 285, 299, 303, 304, 314, 327, 328, 333, 334, 335, 348, 364, 370 (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[400], GCD[ Prime[ # + 1] + 1, Prime[ # ] + 1] == 4 & ]

PROG

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

CROSSREFS

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

Sequence in context: A189396 A189676 A067699 * A176949 A173522 A049420

Adjacent sequences:  A066938 A066939 A066940 * A066942 A066943 A066944

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 17 16:49 EST 2012. Contains 206058 sequences.