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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A055935 a(0)=1; a(n) = Sum { a(j) : j<n, GCD(n,a(j)) = 1 }. 0
1, 1, 2, 4, 2, 10, 2, 22, 2, 46, 2, 72, 2, 168, 2, 88, 2, 428, 2, 858, 2, 620, 2, 2294, 2, 4006, 2, 7546, 2, 16192, 2, 29472, 2, 7442, 2, 60960, 2, 127972, 2, 38738, 2, 296980, 2, 593962, 2, 798786, 2, 1986714, 2, 3926978, 2, 5023380, 2, 12923792, 2, 16513952 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

For j > 0, a(2j) = 2 and a(j+1) is even.

EXAMPLE

a(9) = 46 because all previous terms are relatively prime to 9 and the sum of all previous terms is 46.

CROSSREFS

Sequence in context: A188813 A072866 A061393 * A086930 A099585 A097577

Adjacent sequences:  A055932 A055933 A055934 * A055936 A055937 A055938

KEYWORD

easy,nonn

AUTHOR

Leroy Quet Jul 17 2000

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 23:58 EST 2012. Contains 206085 sequences.