login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A099387 Number of partitions of the n-th minimal number into minimal numbers. 1
1, 2, 4, 7, 24, 46, 138, 507, 1466, 3641, 4806, 106716, 301330, 1173587, 1771791, 7868294, 156060995, 8126341146, 64642714833, 292435587912, 586597464339, 1138023523395, 2232671126262, 21006004690614, 28738943640898, 570863391802477, 88656067576349103 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
A minimal number is the smallest number with a given number of divisors, see A007416;
LINKS
FORMULA
a(n) = A099383(A007416(n)).
EXAMPLE
a(6) = #{6, 4+2, 4+1+1, 2+2+2, 2+2+1+1, 2+1+1+1+1, 1+1+1+1+1+1} = 7.
CROSSREFS
Sequence in context: A059501 A353986 A138049 * A359095 A036440 A103001
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Oct 14 2004
EXTENSIONS
Terms a(16) and beyond from Andrew Howroyd, Apr 20 2021
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 1 22:42 EDT 2024. Contains 372178 sequences. (Running on oeis4.)