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 #3 Mar 30 2012 18:50:48
%S 1,1,1,1,1,1,2,2,1,1,1,1,2,2,1,1,2,2,3,3,2,2,3,3,3,3,2,2,3,3,3,3,2,2,
%T 3,3,4,4,3,3,4,4,5,5,3,3,4,4,5,5,3,3,5,5,6,6,4,4,6,6,7,7,5,5,8,8,9,9,
%U 6,6,9,9,9,9,6,6,10,10,10,10,8,8,12,12,11,11,9,9,12,12,11,11,9,9,12,12,11
%N Number of partitions of n into distinct minimal numbers.
%C A minimal number is the smallest number with a given number of divisors, see A007416;
%C a(2*n) = a(2*n+1) = A099386(n).
%e a(18) = #{16+2, 12+6, 12+4+2} = 3.
%Y Cf. A099383, A000009, A007416, A005179.
%K nonn
%O 0,7
%A _Reinhard Zumkeller_, Oct 14 2004