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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A099383 Number of partitions of n into minimal numbers. 5

%I #3 Mar 30 2012 18:50:48

%S 1,1,2,2,4,4,7,7,11,11,16,16,24,24,33,33,46,46,62,62,82,82,106,106,

%T 138,138,174,174,220,220,274,274,339,339,414,414,507,507,611,611,737,

%U 737,881,881,1049,1049,1239,1239,1466,1466,1717,1717,2012,2012,2344,2344

%N Number of partitions of n into minimal numbers.

%C A minimal number is the smallest number with a given number of divisors, see A007416;

%C a(2*n) = a(2*n+1) = A099385(n).

%e 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,

%e 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.

%Y Cf. A099384, A000041, A007416, A005179.

%K nonn

%O 0,3

%A _Reinhard Zumkeller_, Oct 14 2004

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.

Last modified August 7 03:39 EDT 2024. Contains 375008 sequences. (Running on oeis4.)