This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A139041 #10 Jun 01 2015 18:08:12 %S A139041 1,3,4,6,8,12,24,36,72,96,120,96,102,240,372,384,480,576,1026,960, %T A139041 2340,2016,1512,3224,3240,6720,6336,6588,6048,13104,11232,12768,17784, %U A139041 22176,22344,17978,27072,35112,69696,87552,74496,87048,104544,97216,137088,214896 %N A139041 Sum of divisors of the number of partitions of n. %H A139041 Giovanni Resta, <a href="/A139041/b139041.txt">Table of n, a(n) for n = 1..10000</a> %F A139041 a(n) = sigma(A000041(n)) = A000203(A000041(n)). %e A139041 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. %t A139041 DivisorSigma[1,PartitionsP[Range[50]]] (* _Harvey P. Dale_, Nov 27 2011 *) %o A139041 (PARI) a(n) = sigma(numbpart(n)); \\ _Michel Marcus_, Jun 01 2015 %Y A139041 Cf. A000041, A000203, A139055. %K A139041 nonn %O A139041 1,2 %A A139041 _Omar E. Pol_, Apr 16 2008