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!)
A099386 Number of partitions of 2*n into distinct minimal numbers. 2
1, 1, 1, 2, 1, 1, 2, 1, 2, 3, 2, 3, 3, 2, 3, 3, 2, 3, 4, 3, 4, 5, 3, 4, 5, 3, 5, 6, 4, 6, 7, 5, 8, 9, 6, 9, 9, 6, 10, 10, 8, 12, 11, 9, 12, 11, 9, 12, 11, 9, 13, 12, 10, 14, 12, 10, 14, 12, 11, 15, 14, 13, 17, 16, 14, 18, 15, 13, 18, 15 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
COMMENTS
A minimal number is the smallest number with a given number of divisors, see A007416;
a(n) = A099384(2*n) = A099384(2*n+1).
LINKS
EXAMPLE
a(9) = A099384(18) = #{16+2, 12+6, 12+4+2} = 3.
CROSSREFS
Sequence in context: A105202 A240236 A356606 * A161067 A161106 A161041
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Oct 14 2004
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 April 19 19:02 EDT 2024. Contains 371798 sequences. (Running on oeis4.)