Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A132587
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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)). +0
3
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; listen)
OFFSET

1,8

LINKS

Leroy Quet, Home Page (listed in lieu of email address)

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: A073700 A108775 A074971 this_sequence A008651 A049107 A046597

Adjacent sequences: A132584 A132585 A132586 this_sequence A132588 A132589 A132590

KEYWORD

more,nonn

AUTHOR

Leroy Quet, Aug 23 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 14:50 EST 2009. Contains 167570 sequences.


AT&T Labs Research