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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A066944 Numbers n such that gcd(prime(n+1) + 1, prime(n) + 1) = 10. 7
 34, 80, 127, 145, 157, 175, 204, 222, 266, 289, 308, 316, 397, 442, 443, 518, 525, 578, 593, 656, 690, 746, 757, 773, 793, 832, 861, 866, 892, 908, 923, 949, 958, 971, 985, 1013, 1029, 1051, 1071, 1102, 1125, 1195, 1236, 1314, 1329, 1340, 1350, 1403, 1434 (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[1500], GCD[ Prime[ # + 1] + 1, Prime[ # ] + 1] == 10 & ] PrimePi/@Select[Partition[Prime[Range[1500]], 2, 1], GCD@@(#+1)==10&][[All, 1]] (* Harvey P. Dale, May 05 2018 *) PROG (PARI) { n=0; for (m=1, 10^10, if (gcd(prime(m+1) + 1, prime(m) + 1) == 10, write("b066944.txt", n++, " ", m); if (n==1000, return)) ) } \\ Harry J. Smith, Apr 10 2010 CROSSREFS Cf. A066940, A066941, A066942, A066943, A067603, A067604. Sequence in context: A216432 A118619 A258413 * A044172 A044553 A066284 Adjacent sequences:  A066941 A066942 A066943 * A066945 A066946 A066947 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.

Last modified June 27 19:31 EDT 2022. Contains 354898 sequences. (Running on oeis4.)