OFFSET
1,2
COMMENTS
Also number of partitions of the total number of parts in the partitions of n into equal parts.
Note that one of the partitions of the sum of the divisors of n is also the list of divisors of n in decreasing order, see example.
LINKS
Seiichi Manyama, Table of n, a(n) for n = 1..10000
EXAMPLE
For n = 9 the sum of the divisors of 9 is 1 + 3 + 9 = 13 and the number of partitions of 13 is A000041(13) = 101, so a(9) = 101.
Note that one of the 101 partitions of 13 is [9, 3, 1] and it is also the list of divisors of 9 in decreasing order.
MATHEMATICA
Table[PartitionsP@ DivisorSigma[1, n], {n, 46}] (* Michael De Vlieger, Apr 19 2016 *)
PROG
(PARI) a(n) = numbpart(sigma(n)); \\ Michel Marcus, Apr 19 2016
CROSSREFS
KEYWORD
nonn
AUTHOR
Omar E. Pol, Apr 19 2016
STATUS
approved