login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A214323 a(n) = gcd( A214551(n-1), A214551(n-3) ) with a(0) = a(1) = a(2) = 1. 6
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,7

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

PROG

(Haskell)

a214323 n = a214323_list !! n

a214323_list = 1 : 1 : 1 : zipWith gcd a214551_list (drop 2 a214551_list)

-- Reinhard Zumkeller, Jul 24 2012

CROSSREFS

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

Sequence in context: A125928 A114388 A075789 * A321865 A244544 A159580

Adjacent sequences:  A214320 A214321 A214322 * A214324 A214325 A214326

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Jul 23 2012

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 13 19:52 EDT 2019. Contains 327981 sequences. (Running on oeis4.)