Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A099387
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A099387 Number of partitions of the n-th minimal number into minimal numbers. +0
2
1, 2, 4, 7, 24, 46, 138, 507, 1466, 3641, 4806, 106716, 301330, 1173587, 1771791 (list; graph; listen)
OFFSET

1,2

COMMENT

A minimal number is the smallest number with a given number of divisors, see A007416;

a(n) = A099383(A007416(n)).

EXAMPLE

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.

CROSSREFS

Cf. A099388, A000041, A007416, A005179.

Adjacent sequences: A099384 A099385 A099386 this_sequence A099388 A099389 A099390

Sequence in context: A071795 A059501 A138049 this_sequence A036440 A103001 A065846

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 14 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research