login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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)). 2
1, 1, 2, 1, 3, 1, 4, 1, 2, 1, 1, 1, 8, 1, 2, 1, 1, 1, 12, 1, 2, 1, 1, 1, 16, 1, 2, 5, 1, 1, 19, 1, 1, 1, 1, 1, 2, 1, 3, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 1, 1, 1, 1, 6, 1, 1, 2, 1, 1, 1, 8, 11, 8, 1, 2, 1, 12, 1, 1, 1, 9 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
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: A177812 A280504 A087267 * A289508 A364448 A028920
KEYWORD
nonn
AUTHOR
Leroy Quet, Feb 22 2007
EXTENSIONS
More terms from Diana L. Mecum, Aug 06 2012
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 23:40 EDT 2024. Contains 371798 sequences. (Running on oeis4.)