A085883 Let r and s be such that r + s = n; a(n) = maximum value of tau(r) + tau(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, 10, 12, 11, 12, 10, 14, 10, 12, 12, 13, 11, 14, 11, 14, 12, 13, 11, 16, 11, 14, 13, 14, 12, 16, 12, 15, 13, 14, 12, 17, 13, 14, 14, 16, 14, 17, 14, 16, 15, 16, 14, 18, 14, 16, 16, 17, 14

Offset

2,1

Links

Antti Karttunen, Table of n, a(n) for n = 2..16385

Example

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.

Prog

(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

Crossrefs

Cf. A085887.

Sequence in context: A176504 A196162 A071940 * A356770 A265912 A094192

Adjacent sequences: A085880 A085881 A085882 * A085884 A085885 A085886

Keyword

nonn,look

Author

Amarnath Murthy, Jul 08 2003

Extensions

More terms from David Wasserman, Feb 10 2005

Status

approved