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 A182724 #14 Jan 17 2015 09:36:10 %S A182724 0,2,6,15,28,55,90,154,240,378,560,847,1212,1755,2464,3465,4752,6545, %T A182724 8820,11913,15840,21042,27610,36225,46992,60900,78260,100386,127820, %U A182724 162516,205260,258819,324576,406230,506022,629195,778932,962555,1185030 %N A182724 Sum of all parts of all partitions of n minus the number of partitions of n. %C A182724 a(n) is the sum of (the zeroth moments of) all partitions of n minus the partition number of n. %H A182724 Harvey P. Dale, <a href="/A182724/b182724.txt">Table of n, a(n) for n = 1..1000</a> %F A182724 a(n) = (n-1)*A000041(n) = A066186(n) - A000041(n). %e A182724 a(7) = 90 = (7-1)*15 = 105 - 15, because the number of partitions of 7 is 15 and the sum of all parts of all partitions of 7 is 7*15 = 105. %p A182724 a:= n-> (n-1) *combinat[numbpart](n): %p A182724 seq (a(n), n =1..50); %t A182724 pnxt[n_]:=Module[{ps=IntegerPartitions[n]},Total[Flatten[ps]]- Length[ps]]; Array[pnxt,40] (* _Harvey P. Dale_, Jul 15 2011 *) %t A182724 Table[(n-1)PartitionsP[n],{n,40}] (* _Harvey P. Dale_, Jan 17 2015 *) %Y A182724 Cf. A000041, A066186. Column 1 of A182729. %K A182724 nonn,easy %O A182724 1,2 %A A182724 _Omar E. Pol_, Jan 30 2011