Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

1,4

EXAMPLE

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

The 14th term of this list is 2.

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

CROSSREFS

Cf. A132587, A132588, A038566.

Sequence in context: A070094 A105497 A132662 this_sequence A054843 A038566 A020652

Adjacent sequences: A132586 A132587 A132588 this_sequence A132590 A132591 A132592

KEYWORD

more,nonn

AUTHOR

Leroy Quet (qq-quet(AT)mindspring.com), 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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research