%I #13 Dec 14 2017 21:24:22
%S 2,3,4,4,5,5,6,6,7,6,8,7,8,8,9,8,10,8,10,9,10,8,12,9,10,10,11,10,12,
%T 10,12,11,12,10,14,10,12,12,13,11,14,11,14,12,13,11,16,11,14,13,14,12,
%U 16,12,15,13,14,12,17,13,14,14,16,14,17,14,16,15,16,14,18,14,16,16,17,14
%N Let r and s be such that r + s = n; a(n) = maximum value of tau(r) + tau(s).
%H Antti Karttunen, <a href="/A085883/b085883.txt">Table of n, a(n) for n = 2..16385</a>
%e a(8) = 6, the partitions are (1,7), (2,6), (3,5), (4,4) which give 3, 6, 4 and 6 as the sum of the number of divisors of both parts.
%o (PARI) A085883(n) = { my(m=0); for(r=1,n-1,m = max(m,(numdiv(r)+numdiv(n-r)))); m; }; \\ _Antti Karttunen_, Dec 14 2017
%Y Cf. A085887.
%K nonn,look
%O 2,1
%A _Amarnath Murthy_, Jul 08 2003
%E More terms from _David Wasserman_, Feb 10 2005