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!)
A085886 Let r and s be such that r + s = n; a(n) = minimum value of phi(r) + phi(s). 0

%I

%S 2,2,2,3,3,3,3,4,4,5,4,5,5,6,6,8,6,7,7,8,8,10,8,9,9,10,10,12,10,9,9,

%T 10,10,12,10,13,12,14,12,16,12,13,13,14,14,16,14,17,16,18,16,20,16,19,

%U 18,20,20,22,16,17,17,18,18,20,18,21,20,22,20,24,20,25,22,24,24,28,22,25

%N Let r and s be such that r + s = n; a(n) = minimum value of phi(r) + phi(s).

%e a(8) = 3, the partitions are ( 1,7),(2,6),(3,5),(4,4) which give 7, 3, 6,4 as the sum of phi functions of both the parts.

%Y Cf. A085885.

%K nonn

%O 2,1

%A _Amarnath Murthy_, Jul 08 2003

%E More terms from _David Wasserman_, Feb 10 2005

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 22 23:50 EST 2022. Contains 350504 sequences. (Running on oeis4.)