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

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A139041 Sum of divisors of the number of partitions of n. 5
 1, 3, 4, 6, 8, 12, 24, 36, 72, 96, 120, 96, 102, 240, 372, 384, 480, 576, 1026, 960, 2340, 2016, 1512, 3224, 3240, 6720, 6336, 6588, 6048, 13104, 11232, 12768, 17784, 22176, 22344, 17978, 27072, 35112, 69696, 87552, 74496, 87048, 104544, 97216, 137088, 214896 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Giovanni Resta, Table of n, a(n) for n = 1..10000 FORMULA a(n) = sigma(A000041(n)) = A000203(A000041(n)). EXAMPLE a(7)=24 because the number of partitions of 7 is 15 and the sum of divisors of 15 is equal to 1 + 3 + 5 + 15 = 24. MATHEMATICA DivisorSigma[1, PartitionsP[Range[50]]] (* Harvey P. Dale, Nov 27 2011 *) PROG (PARI) a(n) = sigma(numbpart(n)); \\ Michel Marcus, Jun 01 2015 CROSSREFS Cf. A000041, A000203, A139055. Sequence in context: A277099 A146566 A204658 * A244607 A136483 A240494 Adjacent sequences:  A139038 A139039 A139040 * A139042 A139043 A139044 KEYWORD nonn AUTHOR Omar E. Pol, Apr 16 2008 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 November 26 16:41 EST 2020. Contains 338641 sequences. (Running on oeis4.)