|
Search: id:A099383
|
|
|
| A099383 |
|
Number of partitions of n into minimal numbers. |
|
+0
4
|
|
| 1, 1, 2, 2, 4, 4, 7, 7, 11, 11, 16, 16, 24, 24, 33, 33, 46, 46, 62, 62, 82, 82, 106, 106, 138, 138, 174, 174, 220, 220, 274, 274, 339, 339, 414, 414, 507, 507, 611, 611, 737, 737, 881, 881, 1049, 1049, 1239, 1239, 1466, 1466, 1717, 1717, 2012, 2012, 2344, 2344
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
A minimal number is the smallest number with a given number of divisors, see A007416;
a(2*n) = a(2*n+1) = A099385(n).
|
|
EXAMPLE
|
a(8) = #{6+2, 6+1+1, 4+4, 4+2+2, 4+2+1+1, 4+1+1+1+1, 2+2+2+2,
2+2+2+1+1, 2+2+1+1+1+1, 2+1+1+1+1+1+1, 1+1+1+1+1+1+1+1} = 11.
|
|
CROSSREFS
|
Cf. A099384, A000041, A007416, A005179.
Sequence in context: A085893 A060028 A099770 this_sequence A064410 A062896 A025065
Adjacent sequences: A099380 A099381 A099382 this_sequence A099384 A099385 A099386
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Oct 14 2004
|
|
|
Search completed in 0.002 seconds
|
