This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A098132 Number of compositions of n where the smallest part is greater than the number of parts. 0
 0, 1, 1, 1, 1, 2, 3, 4, 5, 6, 7, 9, 12, 16, 21, 27, 34, 42, 51, 62, 76, 94, 117, 146, 182, 226, 279, 342, 416, 503, 606, 729, 877, 1056, 1273, 1536, 1854, 2237, 2696, 3243, 3891, 4655, 5553, 6607, 7844, 9297, 11006, 13019, 15393, 18195, 21503, 25407, 30010 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,6 LINKS FORMULA G.f.: Sum(x^(k^2+k)/(1-x)^k, k=0..infinity). EXAMPLE a(11)=7 because we have: 11, 8+3, 3+8, 7+4, 4+7, 6+5 and 5+6. MAPLE G:=sum(x^(k^2+k)/(1-x)^k, k=0..20):Gser:=series(G, x=0, 67):seq(coeff(Gser, x^n), n=1..65); (Deutsch) CROSSREFS Cf. A003106, A003114, A077229. Sequence in context: A042952 A126327 A193286 * A017900 A005708 A085793 Adjacent sequences:  A098129 A098130 A098131 * A098133 A098134 A098135 KEYWORD easy,nonn,changed AUTHOR Vladeta Jovovic, Sep 27 2004 EXTENSIONS More terms from Emeric Deutsch, Mar 29 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 .