login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A085883 Let r and s be such that r + s = n; a(n) = maximum value of tau(r) + tau(s). 2
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 (list; graph; refs; listen; history; internal format)
OFFSET

2,1

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 divisors of both the parts.

CROSSREFS

Sequence in context: A176504 A196162 A071940 * A094192 A093874 A047741

Adjacent sequences:  A085880 A085881 A085882 * A085884 A085885 A085886

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jul 08 2003

EXTENSIONS

More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Feb 10 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 11:25 EST 2012. Contains 205777 sequences.