id:A099384 - OEIS Search Results

Search: id:A099384

Displaying 1-1 of 1 results found.

page 1

Number of partitions of n into distinct minimal numbers.

+0
4

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 (list; graph; listen)

	OFFSET	`0,7`
	COMMENT	`A minimal number is the smallest number with a given number of divisors, see A007416;` `a(2n) = a(2n+1) = A099386(n).`
	EXAMPLE	`a(18) = #{16+2, 12+6, 12+4+2} = 3.`
	CROSSREFS	`Cf. A099383, A000009, A007416, A005179.` `Sequence in context: A121561 A078772 A088018 this_sequence A015716 A101598 A157129` `Adjacent sequences: A099381 A099382 A099383 this_sequence A099385 A099386 A099387`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 14 2004`

page 1

Search completed in 0.002 seconds

Last modified December 7 23:50 EST 2009. Contains 170430 sequences.

AT&T Labs Research