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.

A099384 Number of partitions of n into distinct minimal numbers.

This page as a plain text file.
%I A099384 #3 Mar 30 2012 18:50:48
%S A099384 1,1,1,1,1,1,2,2,1,1,1,1,2,2,1,1,2,2,3,3,2,2,3,3,3,3,2,2,3,3,3,3,2,2,
%T A099384 3,3,4,4,3,3,4,4,5,5,3,3,4,4,5,5,3,3,5,5,6,6,4,4,6,6,7,7,5,5,8,8,9,9,
%U A099384 6,6,9,9,9,9,6,6,10,10,10,10,8,8,12,12,11,11,9,9,12,12,11,11,9,9,12,12,11
%N A099384 Number of partitions of n into distinct minimal numbers.
%C A099384 A minimal number is the smallest number with a given number of divisors, see A007416;
%C A099384 a(2*n) = a(2*n+1) = A099386(n).
%e A099384 a(18) = #{16+2, 12+6, 12+4+2} = 3.
%Y A099384 Cf. A099383, A000009, A007416, A005179.
%K A099384 nonn
%O A099384 0,7
%A A099384 _Reinhard Zumkeller_, Oct 14 2004