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!)
A055935 a(0)=1; a(n) = Sum_{j<n, gcd(n,a(j)) = 1} a(j). 0

%I #12 Oct 26 2019 02:07:43

%S 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,

%T 4006,2,7546,2,16192,2,29472,2,7442,2,60960,2,127972,2,38738,2,296980,

%U 2,593962,2,798786,2,1986714,2,3926978,2,5023380,2,12923792,2,16513952

%N a(0)=1; a(n) = Sum_{j<n, gcd(n,a(j)) = 1} a(j).

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

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

%K easy,nonn

%O 0,3

%A _Leroy Quet_, Jul 17 2000

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 16:08 EDT 2024. Contains 371794 sequences. (Running on oeis4.)