A099384 Number of partitions of n into distinct minimal numbers.

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

Links

Table of n, a(n) for n=0..96.

Example

a(18) = #{16+2, 12+6, 12+4+2} = 3.

Crossrefs

Cf. A099383, A000009, A007416, A005179.

Sequence in context: A088018 A204909 A214211 * A015716 A308884 A101598

Adjacent sequences: A099381 A099382 A099383 * A099385 A099386 A099387

Keyword

nonn

Author

Reinhard Zumkeller, Oct 14 2004

Status

approved