This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A025149 Number of partitions of n into distinct parts >= 4. 3
 1, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 6, 6, 8, 9, 11, 12, 15, 17, 20, 23, 27, 31, 36, 41, 47, 55, 62, 71, 81, 93, 105, 120, 135, 154, 174, 197, 221, 251, 281, 317, 356, 400, 447, 502, 561, 628, 701, 782, 871, 972, 1081, 1202, 1336, 1483, 1645, 1825, 2021, 2237, 2476, 2736 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,10 LINKS FORMULA a(n)=A026824(n+3). - R. J. Mathar, Jul 31 2008 G.f.: product_{j=4..infinity} (1+x^j). - R. J. Mathar, Jul 31 2008 G.f.: sum(n>=0, x^(n*(n+7)/2) / prod(k=1..n, 1-x^k) ); special case of g.f. for partitions into distinct parts >= L, sum(n>=0, x^(n*(n+2*L-1)/2) / prod(k=1..n, 1-x^k) ).  [Joerg Arndt, Mar 24 2011] MAPLE g:=product(1+x^(j), j=4..54): gser:=series(g, x=0, 55): seq(coeff(gser, x, n), n=1..53); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Mar 09 2007 CROSSREFS Cf. A025147. Sequence in context: A003106 A185228 A026824 * A026799 A185326 A210716 Adjacent sequences:  A025146 A025147 A025148 * A025150 A025151 A025152 KEYWORD nonn AUTHOR EXTENSIONS More terms from N. J. A. Sloane, Sep 28 2008 STATUS approved

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

Content is available under The OEIS End-User License Agreement .