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.

A099385 Number of partitions of 2*n into minimal numbers.

This page as a plain text file.
%I A099385 #3 Mar 30 2012 18:50:48
%S A099385 1,2,4,7,11,16,24,33,46,62,82,106,138,174,220,274,339,414,507,611,737,
%T A099385 881,1049,1239,1466,1717,2012,2344,2724,3148,3641,4182,4806,5499,6282,
%U A099385 7148,8137,9216,10441,11789,13297,14951,16814,18837,21106,23584,26331
%N A099385 Number of partitions of 2*n into minimal numbers.
%C A099385 A minimal number is the smallest number with a given number of divisors, see A007416;
%e A099385 a(4) = A099383(8) = #{6+2, 6+1+1, 4+4, 4+2+2, 4+2+1+1,
%e A099385 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,
%e A099385 1+1+1+1+1+1+1+1} = 11.
%Y A099385 Cf. A099386, A000041, A007416, A005179.
%K A099385 nonn
%O A099385 0,2
%A A099385 _Reinhard Zumkeller_, Oct 14 2004