id:A099388 - OEIS Search Results

Search: id:A099388

Displaying 1-1 of 1 results found.

page 1

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

+0
2

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

	OFFSET	`1,4`
	COMMENT	`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 this_sequence A022869 A022865 A089150` `Adjacent sequences: A099385 A099386 A099387 this_sequence A099389 A099390 A099391`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 14 2004`

page 1

Search completed in 0.002 seconds

Last modified November 27 14:50 EST 2009. Contains 167570 sequences.