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

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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A085884 Let r and s be such that r + s = n; a(n) = maximum value of sigma(r) + sigma(s). 5
 2, 4, 6, 8, 10, 13, 15, 16, 19, 19, 24, 29, 31, 32, 35, 34, 40, 40, 43, 43, 46, 46, 56, 61, 63, 64, 67, 66, 72, 73, 75, 76, 79, 78, 88, 92, 94, 95, 98, 97, 103, 99, 106, 104, 109, 103, 120, 125, 127, 128, 131, 130, 136, 132, 139, 137, 142, 136, 152, 169, 171, 172, 175 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,1 LINKS Charles R Greathouse IV, Table of n, a(n) for n = 2..10000 EXAMPLE a(8) = 6, the partitions are ( 1,7),(2,6),(3,5),(4,4) which give 9, 15,10,14 as the sum of the sigma function of both the parts. MATHEMATICA a[n_] := Max[Total[DivisorSigma[1, #]]& /@ IntegerPartitions[n, {2}]]; Table[a[n], {n, 2, 100}] (* Jean-François Alcover, Dec 26 2013 *) PROG (PARI) a(n)=my(best=sigma(n-1)+1); for(k=2, n\2, best=max(best, sigma(k)+sigma(n-k))); best \\ Charles R Greathouse IV, Apr 06 2012 CROSSREFS Cf. A085883. Sequence in context: A194390 A187688 A334292 * A246404 A246408 A182766 Adjacent sequences:  A085881 A085882 A085883 * A085885 A085886 A085887 KEYWORD nonn AUTHOR Amarnath Murthy, Jul 08 2003 EXTENSIONS More terms from David Wasserman, Feb 10 2005 STATUS approved

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.

Last modified December 8 12:28 EST 2021. Contains 349596 sequences. (Running on oeis4.)