cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A099383 Number of partitions of n into minimal numbers.

This page as a plain text file.
%I A099383 #3 Mar 30 2012 18:50:48
%S A099383 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 A099383 138,138,174,174,220,220,274,274,339,339,414,414,507,507,611,611,737,
%U A099383 737,881,881,1049,1049,1239,1239,1466,1466,1717,1717,2012,2012,2344,2344
%N A099383 Number of partitions of n into minimal numbers.
%C A099383 A minimal number is the smallest number with a given number of divisors, see A007416;
%C A099383 a(2*n) = a(2*n+1) = A099385(n).
%e A099383 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 A099383 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 A099383 Cf. A099384, A000041, A007416, A005179.
%K A099383 nonn
%O A099383 0,3
%A A099383 _Reinhard Zumkeller_, Oct 14 2004