A214323 a(n) = gcd( A214551(n-1), A214551(n-3) ) with a(0) = a(1) = a(2) = 1.

1, 1, 1, 1, 1, 1, 2, 3, 2, 3, 2, 1, 1, 1, 1, 7, 3, 2, 3, 4, 1, 1, 1, 1, 1, 1, 4, 1, 5, 1, 1, 1, 1, 8, 1, 2, 1, 6, 1, 4, 5, 4, 5, 1, 1, 1, 1, 11, 36, 1, 1, 1, 7, 5, 1, 8, 3, 4, 3, 2, 7, 2, 1, 1, 1, 3, 1, 1, 2, 1, 1, 1, 3, 1, 1, 2, 1, 1, 1, 1, 1

Offset: 0

Author

N. J. A. Sloane, Jul 23 2012

Keywords

• nonn

Comments

A214551(n) = A214322(n)/A214323(n).

A214323(A214653(n)) = 1. - Reinhard Zumkeller, Jul 24 2012

Links

• N. J. A. Sloane, Table of n, a(n) for n = 0..10000

Crossrefs

Cf. A214551, A214322; A214324, A214325 (record values and where they occur).

Programs

Haskell

a214323 n = a214323_list !! n
a214323_list = 1 : 1 : 1 : zipWith gcd a214551_list (drop 2 a214551_list)
-- Reinhard Zumkeller, Jul 24 2012