login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A085885 Let r and s be such that r + s = n; a(n) = maximum value of phi(r) + phi(s). 1

%I

%S 2,2,3,3,5,5,7,7,8,8,11,11,13,13,14,14,17,17,19,19,20,20,23,23,24,24,

%T 26,24,29,29,31,31,32,32,34,32,37,37,38,38,41,41,43,43,44,44,47,47,48,

%U 48,50,48,53,53,54,54,56,54,59,59,61,61,62,62,64,62,67,67,68,68,71,71,73

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

%e a(8) = 7, 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.

%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 February 25 08:21 EST 2020. Contains 332221 sequences. (Running on oeis4.)