A099388 - OEIS

This site is supported by donations to The OEIS Foundation.

A099388

Number of partitions of the n-th minimal number into distinct minimal numbers.

1, 1, 1, 2, 2, 2, 3, 4, 5, 7, 8, 14, 17, 21, 25, 39, 70, 142 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,4`
	COMMENTS	`A minimal number is the smallest number with a given number of divisors, see A007416;` `a(n) = A099384(A007416(n)).`
	EXAMPLE	`a(6) = #{6, 4+2} = 2.`
	CROSSREFS	`Cf. A099387, A000009, A007416, A005179.` `Sequence in context: A005855 A096748 A022866 * A193941 A022869 A022865` `Adjacent sequences: A099385 A099386 A099387 * A099389 A099390 A099391`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 14 2004`

Content is available under The OEIS End-User License Agreement .

Last modified February 14 23:53 EST 2012. Contains 205689 sequences.