A218535 Greatest common divisor of consecutive terms in A176352.

1, 2, 3, 3, 4, 4, 5, 5, 15, 9, 3, 5, 5, 25, 35, 14, 7, 7, 8, 4, 7, 7, 7, 14, 42, 42, 30, 18, 8, 16, 20, 10, 25, 45, 27, 27, 33, 11, 11, 11, 33, 33, 33, 24, 6, 9, 9, 12, 15, 15, 21, 21, 42, 66, 36, 108, 117, 13, 65, 91, 91, 91, 13, 13, 39, 33, 22, 22, 11, 13

Offset: 1

Author

Reinhard Zumkeller, Nov 10 2012

Keywords

• nonn

Comments

a(n) = gcd(A176352(n),A176352(n+1)).

Links

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

Crossrefs

Cf. A176352, A218533, A218534.

Programs

Haskell

import Data.Ratio ((%), numerator, denominator)
a218535 n = a218535_list !! (n-1)
a218535_list = zipWith gcd a176352_list $ tail a176352_list
-- .