login
A099384
Number of partitions of n into distinct minimal numbers.
3
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, 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, 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
OFFSET
0,7
COMMENTS
A minimal number is the smallest number with a given number of divisors, see A007416;
a(2*n) = a(2*n+1) = A099386(n).
EXAMPLE
a(18) = #{16+2, 12+6, 12+4+2} = 3.
CROSSREFS
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Oct 14 2004
STATUS
approved