login

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”).

A099383
Number of partitions of n into minimal numbers.
5
1, 1, 2, 2, 4, 4, 7, 7, 11, 11, 16, 16, 24, 24, 33, 33, 46, 46, 62, 62, 82, 82, 106, 106, 138, 138, 174, 174, 220, 220, 274, 274, 339, 339, 414, 414, 507, 507, 611, 611, 737, 737, 881, 881, 1049, 1049, 1239, 1239, 1466, 1466, 1717, 1717, 2012, 2012, 2344, 2344
OFFSET
0,3
COMMENTS
A minimal number is the smallest number with a given number of divisors, see A007416;
a(2*n) = a(2*n+1) = A099385(n).
EXAMPLE
a(8) = #{6+2, 6+1+1, 4+4, 4+2+2, 4+2+1+1, 4+1+1+1+1, 2+2+2+2,
2+2+2+1+1, 2+2+1+1+1+1, 2+1+1+1+1+1+1, 1+1+1+1+1+1+1+1} = 11.
CROSSREFS
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Oct 14 2004
STATUS
approved