cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A107294 GCD of (n + prime(n)) and (n + 1 + prime(n+1)).

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 3, 1, 1, 3, 7, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 3, 1, 1, 3, 1, 1, 1, 1, 1, 7, 1, 1, 1, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 5, 1, 1, 1, 1, 5, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
Offset: 1

Views

Author

Zak Seidov, May 20 2005

Keywords

Examples

			a(139) = 13 because {(139 + prime(139)), (140 + prime(140))} = {936, 949} ={13*72,13*73}.
		

Crossrefs

Cf. A014688.

Programs

  • Mathematica
    Table[GCD[n+Prime[n], n+1+Prime[n+1]], {n, 150}]
    GCD@@#&/@Partition[Table[n+Prime[n],{n,150}],2,1] (* Harvey P. Dale, Mar 19 2023 *)