Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A128267
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A128267 a(0) = 1; a(n) = GCD((number of earlier terms which are coprime to n),(sum of the earlier terms which are coprime to n)). +0
2
1, 1, 2, 1, 3, 1, 4, 1, 2, 1, 1, 1, 8 (list; graph; listen)
OFFSET

0,3

LINKS

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

EXAMPLE

The terms among {a(0),a(1),...a(7)} that are coprime to 8 are a(0)=1, a(1)=1, a(3)=1, a(4)=3, a(5)=1 and a(7)=1. There are 6 such terms and the sum of these terms is 8. So a(8) = GCD(6,8) = 2.

CROSSREFS

Cf. A128268.

Sequence in context: A142593 A102547 A087267 this_sequence A028920 A055396 A057499

Adjacent sequences: A128264 A128265 A128266 this_sequence A128268 A128269 A128270

KEYWORD

more,nonn

AUTHOR

Leroy Quet Feb 22 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 | The OEIS Foundation | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified March 20 09:10 EDT 2010. Contains 173642 sequences.


AT&T Labs Research