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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A132587 Let b(k) be the k-th term of the flattened irregular array where the m-th row contains the positive divisors of m. (b(k) = A027750(k).) Let c(k) be the k-th term of the flattened irregular array where the m-th row contains the positive integers that are <= m and are coprime to m. (c(k) = A038566(k).) Then a(n) = GCD(b(n),c(n)). 2
1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 5, 1 (list; graph; refs; listen; history; internal format)
OFFSET

1,8

EXAMPLE

A027750: 1,1,2,1,3,1,2,4,1,5,1,2,3,6,...

A038566: 1,1,1,2,1,3,1,2,3,4,1,5,1,2,...

The 14th terms of each list are 6 and 2.

So a(14) = GCD(6,2) = 2.

CROSSREFS

Cf. A132588, A132589, A027750, A038566.

Sequence in context: A108775 A074971 A198067 * A204697 A008651 A049107

Adjacent sequences:  A132584 A132585 A132586 * A132588 A132589 A132590

KEYWORD

more,nonn

AUTHOR

Leroy Quet, Aug 23 2007

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 13:09 EST 2012. Contains 206029 sequences.