login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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

%I #4 Dec 05 2013 19:56:18

%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