A251102 a(n) = gcd(A098550(n+2), A098550(n)).

1, 2, 3, 4, 3, 2, 5, 2, 5, 6, 5, 4, 7, 2, 7, 10, 3, 2, 3, 11, 13, 11, 13, 3, 2, 3, 4, 17, 2, 17, 6, 5, 2, 5, 2, 13, 6, 7, 2, 7, 19, 21, 19, 2, 19, 4, 3, 10, 23, 2, 23, 4, 5, 2, 3, 2, 3, 2, 29, 31, 29, 31, 2, 3, 4, 11, 2, 7, 6, 7, 6, 7, 6, 7, 2, 35, 37, 35

Offset: 1

Author

Reinhard Zumkeller, Nov 30 2014

Keywords

• nonn

Comments

For n > 1: a(n) > 1, by definition of A098550;

gcd(a(n+1), a(n)) = 1;

gcd(a(n), A098550(n)) = a(n).

Links

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

Crossrefs

Cf. A098550, A253581.

Programs

Haskell

a251102 n = a251102_list !! (n-1)
a251102_list = zipWith gcd (drop 2 a098550_list) a098550_list