A338440 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A338440

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

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

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

COMMENTS

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

LINKS

Rémy Sigrist, Table of n, a(n) for n = 1..10000

Rémy Sigrist, C program for A338440

FORMULA

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

EXAMPLE

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