A249694 a(n) = gcd(A084937(n), A084937(n+3)).

1, 2, 1, 1, 4, 1, 1, 2, 1, 1, 2, 1, 1, 2, 3, 1, 2, 5, 1, 2, 1, 1, 2, 1, 1, 6, 1, 1, 2, 1, 1, 2, 3, 1, 2, 3, 1, 4, 3, 1, 2, 1, 1, 2, 1, 3, 2, 1, 3, 4, 1, 1, 8, 1, 1, 6, 1, 1, 6, 1, 1, 2, 5, 1, 2, 3, 1, 4, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 4, 1, 1, 2

Offset

1,2

Comments

gcd(A084937(n), A084937(n+1)) = gcd(A084937(n), A084937(n+2)) = 1 by definition of A084937.

Links

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Prog

(Haskell)
a249694 n = a249694_list !! (n-1)
a249694_list = zipWith gcd (drop 3 a084937_list) a084937_list

Crossrefs

Cf. A084937.

Sequence in context: A064645 A285425 A008307 * A192005 A333810 A205592

Adjacent sequences: A249691 A249692 A249693 * A249695 A249696 A249697

Keyword

nonn

Author

Reinhard Zumkeller, Nov 04 2014

Status

approved