This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A098133 Number of compositions of n where the smallest part is equal to the number of parts. 0
 1, 0, 0, 1, 2, 2, 2, 2, 3, 5, 8, 11, 14, 17, 20, 24, 30, 39, 52, 69, 90, 115, 144, 177, 215, 260, 315, 384, 472, 584, 725, 900, 1114, 1372, 1679, 2041, 2466, 2965, 3553, 4250, 5082, 6081, 7285, 8738, 10490, 12597, 15121, 18130, 21699, 25912, 30865, 36670 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 LINKS FORMULA G.f.: Sum((x^(m^2)-x^(m*(m+1)))/(1-x)^m, m=1..infinity). EXAMPLE a(9)=3 because we have [2,7],[7,2] and [3,3,3]. MAPLE G:=sum((x^(m^2)-x^(m*(m+1)))/(1-x)^m, m=1..35):Gser:=series(G, x=0, 60): seq(coeff(Gser, x^n), n=1..58); (Deutsch) CROSSREFS Cf. A006141. Sequence in context: A098527 A035635 A029100 * A138185 A225941 A138705 Adjacent sequences:  A098130 A098131 A098132 * A098134 A098135 A098136 KEYWORD easy,nonn,changed AUTHOR Vladeta Jovovic, Sep 27 2004 EXTENSIONS More terms from Emeric Deutsch, Apr 18 2005 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 .