Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026007
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A026007 Expansion of Product(1+q^m)^m; m=1..inf; number of partitions of n into distinct parts, where n different parts of size n are available. +0
4
1, 1, 2, 5, 8, 16, 28, 49, 83, 142, 235, 385, 627, 1004, 1599, 2521, 3940, 6111, 9421, 14409, 21916, 33134, 49808, 74484, 110837, 164132, 241960, 355169, 519158, 755894, 1096411, 1584519, 2281926, 3275276 (list; graph; listen)
OFFSET

0,3

COMMENT

Contribution from Gary W. Adamson (qntmpkt(AT)yahoo.com), Jun 13 2009: (Start)

Equals A000219: (1, 1, 3, 6, 13, 24, 48, 86,...) convolved with the aerated

version of the latter: (1, 0, 1, 0, 3, 0, 6, 0, 13,...). (End)

FORMULA

a(n) = 1/n*Sum_{k=1..n} A078306(k)*a(n-k). - Vladeta Jovovic (vladeta(AT)eunet.rs), Nov 22 2002

G.f. Product_{m=1}^{infinity} (1+x^m)^m. Weighout transform of natural numbers (A000027). Euler transform of A026741. - Frank Adams-Watters (FrankTAW(AT)Netscape.net), Mar 16 2006

EXAMPLE

For n = 4, we have 8 partitions [4], [4'], [4''], [4'''], [3,1], [3',1], [3'',1] and [2,2'].

CROSSREFS

Cf. A000009, A000219, A000027, A026741.

A000219 [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Jun 13 2009]

Sequence in context: A096541 A137685 A093065 this_sequence A032233 A026530 A032254

Adjacent sequences: A026004 A026005 A026006 this_sequence A026008 A026009 A026010

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

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 December 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research