Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #10 Jan 05 2021 05:03:42
%S 1,2,3,5,4,10,6,17,14,26,13,66,19,63,60,126,39,243,55,338,179,310,105,
%T 1154,209,637,482,1458,257,3329,341,2878,1200,2386,1178,11262,761,
%U 4400,2834,14512,1261,23052,1611,18255,10551,13858,2591,83810,4678,38243
%N Number of partitions of n such that multiplicities of parts are divisors of n.
%H Martin Klazar, <a href="http://arxiv.org/abs/1808.08449">What is an answer? — remarks, results and problems on PIO formulas in combinatorial enumeration, part I</a>, arXiv:1808.08449 [math.CO], 2018.
%F Coefficient of x^n in expansion of Product_{k=1..n} (1+Sum_{d|n} x^(d*k)).
%p with(numtheory): seq(coeff(mul(1+add(x^(d*k),d=divisors(n)),k=1..n),x,n),n=1..60); # C. Ronaldo (aga_new_ac(AT)hotmail.com), Jan 19 2005
%Y Cf. A018818.
%K easy,nonn
%O 1,2
%A _Vladeta Jovovic_, Jan 11 2005
%E More terms from C. Ronaldo (aga_new_ac(AT)hotmail.com), Jan 19 2005