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.

A338440 a(n) is the greatest common divisor of A338338(n), A338338(n+1) and A338338(n+2).

Original entry on oeis.org

1, 2, 1, 3, 1, 1, 5, 2, 1, 1, 7, 2, 1, 3, 5, 2, 1, 1, 11, 2, 1, 3, 7, 2, 1, 3, 1, 11, 5, 2, 1, 13, 1, 3, 4, 1, 1, 17, 2, 1, 19, 1, 3, 5, 2, 7, 3, 1, 17, 5, 2, 1, 23, 1, 3, 2, 11, 1, 7, 5, 3, 1, 2, 13, 3, 1, 1, 5, 13, 2, 1, 29, 1, 3, 10, 1, 1, 31, 2, 1, 1, 37
Offset: 1

Views

Author

Rémy Sigrist, Oct 28 2020

Keywords

Comments

No prime factor of a(n) divides A338338(n+3).

Examples

			a(4) = gcd(A338338(4), A338338(5), A338338(6)) = gcd(6, 3, 9) = 3.
		

Crossrefs

Cf. A338338.

Programs

  • C
    // See Links section.

Formula

gcd(a(n), A338338(n+3)) = 1.