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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A249694 GCD(A084937(n),A084937(n+3). 2
1, 2, 1, 1, 4, 1, 1, 2, 1, 1, 2, 1, 1, 2, 3, 1, 2, 5, 1, 2, 1, 1, 2, 1, 1, 6, 1, 1, 2, 1, 1, 2, 3, 1, 2, 3, 1, 4, 3, 1, 2, 1, 1, 2, 1, 3, 2, 1, 3, 4, 1, 1, 8, 1, 1, 6, 1, 1, 6, 1, 1, 2, 5, 1, 2, 3, 1, 4, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 4, 1, 1, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

GCD(A084937(n),A084937(n+1) = GCD(A084937(n),A084937(n+2) = 1 by definition of A084937.

LINKS

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

PROG

(Haskell)

a249694 n = a249694_list !! (n-1)

a249694_list = zipWith gcd (drop 3 a084937_list) a084937_list

CROSSREFS

Cf. A084937.

Sequence in context: A064645 A285425 A008307 * A192005 A205592 A099238

Adjacent sequences:  A249691 A249692 A249693 * A249695 A249696 A249697

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller, Nov 04 2014

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified February 24 06:13 EST 2018. Contains 299597 sequences. (Running on oeis4.)