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.

A099386 Number of partitions of 2*n into distinct minimal numbers.

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