login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066943 Numbers n such that gcd(prime(n+1) + 1, prime(n) + 1) = 8. 7
72, 92, 128, 132, 156, 166, 228, 246, 281, 282, 386, 417, 507, 519, 619, 620, 640, 641, 661, 712, 738, 739, 759, 801, 853, 898, 915, 1000, 1077, 1152, 1241, 1246, 1273, 1289, 1297, 1364, 1389, 1421, 1489, 1493, 1525, 1543, 1564, 1632, 1691, 1699, 1729 (list; graph; refs; listen; history; text; 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] == 8 & ]

PROG

(PARI) { n=0; for (m=1, 10^10, if (gcd(prime(m+1) + 1, prime(m) + 1) == 8, write("b066943.txt", n++, " ", m); if (n==1000, return)) ) } \\ Harry J. Smith, Apr 10 2010

CROSSREFS

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

Sequence in context: A039364 A043967 A248970 * A206264 A063922 A063923

Adjacent sequences:  A066940 A066941 A066942 * A066944 A066945 A066946

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 12 12:23 EDT 2020. Contains 336439 sequences. (Running on oeis4.)