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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066942 GCD(prime(n+1)+1, prime(n)+1)=6. 7
9, 15, 16, 23, 32, 39, 40, 51, 54, 55, 56, 71, 76, 86, 96, 97, 102, 103, 107, 108, 118, 119, 123, 139, 160, 161, 164, 165, 170, 184, 185, 194, 195, 199, 200, 208, 218, 219, 227, 238, 245, 252, 255, 267, 290, 291, 292, 293, 298, 311, 312, 329, 342, 345, 349 (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] == 6 & ]

PROG

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

CROSSREFS

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

Sequence in context: A058957 A105882 A136410 * A061838 A037002 A071149

Adjacent sequences:  A066939 A066940 A066941 * A066943 A066944 A066945

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 14 23:53 EST 2012. Contains 205689 sequences.