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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A132589 GCD(A038566(n),n). 2
1, 1, 1, 2, 1, 3, 1, 2, 3, 2, 1, 1, 1, 2, 3, 4, 1, 6, 1, 1, 1, 1, 1, 2, 1, 1, 1, 4, 1, 3, 1, 1, 1, 2, 1, 4, 1, 2, 1, 8, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 3, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 5, 1, 1, 1, 1, 5, 1, 2, 1, 4, 5, 2, 1, 8, 1, 10, 1, 4, 1, 2, 5, 16, 1, 1, 1, 1, 1, 17, 1, 2 (list; graph; refs; listen; history; internal format)
OFFSET

1,4

FORMULA

a(n) = GCD(A038566(n),n).

EXAMPLE

a(14) = GCD(A038566(14),14) = GCD(2,14) = 2.

CROSSREFS

Cf. A132587, A132588, A038566.

Sequence in context: A070094 A105497 A132662 * A054843 A038566 A020652

Adjacent sequences:  A132586 A132587 A132588 * A132590 A132591 A132592

KEYWORD

nonn

AUTHOR

Leroy Quet Aug 23 2007

EXTENSIONS

Edited and extended by Max Alekseyev (maxale(AT)gmail.com), Apr 26 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 11:17 EST 2012. Contains 206011 sequences.