|
Search: id:A047966
|
|
|
| A047966 |
|
a(n) = Sum_{ d divides n } q(d), where q(d) = A000009 = number of partitions of d into distinct parts. |
|
+0
5
|
|
| 1, 2, 3, 4, 4, 8, 6, 10, 11, 15, 13, 25, 19, 29, 33, 42, 39, 62, 55, 81, 84, 103, 105, 153, 146, 185, 203, 253, 257, 344, 341, 432, 463, 552, 594, 747, 761, 920, 1003, 1200, 1261, 1537, 1611, 1921, 2089, 2410, 2591, 3095, 3270, 3815, 4138, 4769
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Number of partitions of n such that every part occurs with the same multiplicity. - Vladeta Jovovic (vladeta(AT)eunet.rs), Oct 22 2004
Contribution from Gary W. Adamson (qntmpkt(AT)yahoo.com), Jun 08 2009: (Start)
Equals inverse Mobius transform (A051731) * A000009, where the latter begins
(1, 1, 2, 2, 3, 4, 5, 6, 8,...) (End)
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..1000
|
|
FORMULA
|
G.f.: Sum_{k>0} (-1+Product_{i>0} (1+z^(k*i))). - Vladeta Jovovic (vladeta(AT)eunet.rs), Jun 22 2003
|
|
CROSSREFS
|
Cf. A000009, A024994, A047968.
Sequence in context: A006087 A136330 A028298 this_sequence A097093 A056877 A118263
Adjacent sequences: A047963 A047964 A047965 this_sequence A047967 A047968 A047969
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
