A066942 Numbers n such that gcd(prime(n+1) + 1, prime(n) + 1) = 6.

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

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 & ]
Drop[Position[Partition[Prime[Range[400]], 2, 1], _?(GCD@@(#+1)==6&)], 2]//Flatten (* Harvey P. Dale, Nov 08 2022 *)

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)) ) } \\ Harry J. Smith, Apr 10 2010

Crossrefs

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

Sequence in context: A105882 A136410 A324879 * A257048 A363896 A061838

Adjacent sequences: A066939 A066940 A066941 * A066943 A066944 A066945

Keyword

nonn

Author

Benoit Cloitre, Jan 24 2002

Extensions

Edited by Robert G. Wilson v, Feb 01 2002

Status

approved