A057467 GCD of n-th and (n+1)-st term in the sequence of first differences between primes, A001223.

1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 6, 2, 2, 2, 2, 2, 2, 2, 2, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 6, 2, 2, 6, 2, 2, 2, 2, 2, 2, 12, 4, 2, 2, 2, 2, 2, 2, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 6, 2, 2, 2, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 4, 2, 2, 4, 4, 4, 4, 4, 2, 6, 2, 2, 6, 2, 2, 6, 2, 2

Offset

1,2

Links

Table of n, a(n) for n=1..104.

Formula

a(n) = gcd( A001223(n+1), A001223(n) ).

Mathematica

Map[GCD @@ # &, Partition[#, 2, 1] &@ Differences@ Prime@ Range@ 100] (* Michael De Vlieger, Feb 18 2017 *)

Crossrefs

Cf. A001223.

Sequence in context: A135663 A090620 A151659 * A074594 A211667 A001069

Adjacent sequences: A057464 A057465 A057466 * A057468 A057469 A057470

Keyword

nonn,easy

Author

Labos Elemer, Dec 06 2000

Status

approved