A255481 a(n) = gcd(b(n),b(n-1)), where b(n) = A255582(n).

1, 1, 1, 2, 2, 1, 1, 2, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 3, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 3, 1, 2, 2, 2, 2, 1, 1, 1, 3, 3, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 1, 1, 3, 3, 3, 2, 1, 1, 2, 2, 2, 1, 1, 1, 1, 1, 3, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1

Offset: 2

Author

N. J. A. Sloane, Feb 28 2015

Keywords

• nonn

Comments

By definition, a(n) <= A255480(n) for n >= 4.

Links

• Ray Chandler, Table of n, a(n) for n = 2..10001

Crossrefs

Cf. A255582, A255480, A255479.

Programs

Haskell

a255481 n = a255481_list !! (n-1)
a255481_list = zipWith gcd a255582_list $ tail a255582_list
-- Reinhard Zumkeller, Mar 10 2015