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.

A099387 Number of partitions of the n-th minimal number into minimal numbers.

This page as a plain text file.
%I A099387 #9 Apr 20 2021 16:51:44
%S A099387 1,2,4,7,24,46,138,507,1466,3641,4806,106716,301330,1173587,1771791,
%T A099387 7868294,156060995,8126341146,64642714833,292435587912,586597464339,
%U A099387 1138023523395,2232671126262,21006004690614,28738943640898,570863391802477,88656067576349103
%N A099387 Number of partitions of the n-th minimal number into minimal numbers.
%C A099387 A minimal number is the smallest number with a given number of divisors, see A007416;
%F A099387 a(n) = A099383(A007416(n)).
%e A099387 a(6) = #{6, 4+2, 4+1+1, 2+2+2, 2+2+1+1, 2+1+1+1+1, 1+1+1+1+1+1} = 7.
%Y A099387 Cf. A099388, A000041, A007416, A005179.
%K A099387 nonn
%O A099387 1,2
%A A099387 _Reinhard Zumkeller_, Oct 14 2004
%E A099387 Terms a(16) and beyond from _Andrew Howroyd_, Apr 20 2021