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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A057467 GCD of n-th and (n+1)-st term in the sequence of first differences between primes, A001223. 6
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

REFERENCES

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

LINKS

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

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified July 22 03:22 EDT 2017. Contains 289648 sequences.