login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A130689 Number of partitions of n such that every part divides the largest part. 0
1, 1, 2, 3, 5, 6, 10, 11, 16, 19, 26, 28, 41, 43, 56, 65, 82, 88, 115, 122, 155, 174, 209, 225, 283, 305, 363, 402, 477, 514, 622, 666, 783, 858, 990, 1078, 1268, 1362, 1561, 1708, 1958, 2111, 2433, 2613, 2976, 3247, 3652, 3938, 4482, 4821, 5422 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Table of n, a(n) for n=0..50.

FORMULA

G.f.: Sum_{n>=0} x^n/Product_{d divides n} (1-x^d).

EXAMPLE

For n =6 we have 10 such partitions: [1, 1, 1, 1, 1, 1], [1, 1, 1, 1, 2],

[1, 1, 2, 2], [2, 2, 2], [1, 1, 1, 3], [3, 3], [1, 1, 4], [2, 4], [1, 5], [6].

CROSSREFS

Cf. A018818, A083710, A097986, A117086.

Sequence in context: A003238 A051839 A130714 * A024560 A000039 A302600

Adjacent sequences:  A130686 A130687 A130688 * A130690 A130691 A130692

KEYWORD

easy,nonn

AUTHOR

Vladeta Jovovic, Jul 01 2007

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 16 00:50 EDT 2018. Contains 316252 sequences. (Running on oeis4.)