The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A096401 Number of balanced partitions of n into distinct parts: least part is equal to number of parts. 3
 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 8, 8, 10, 11, 13, 14, 17, 18, 21, 23, 26, 28, 32, 35, 39, 43, 48, 53, 59, 65, 72, 80, 88, 97, 107, 118, 129, 142, 155, 171, 186, 204, 222, 244, 265, 290, 315, 345, 374, 409, 443, 484, 524, 571, 618, 673, 727, 790 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,12 LINKS FORMULA G.f.: Sum((x^(m*(3*m-1)/2)-x^(m*(3*m+1)/2))/Product(1-x^i, i=1..m), m=1..infinity). EXAMPLE a(14)=3 because we have 12+2, 7+4+3 and 6+5+3. MAPLE G:=sum((x^(m*(3*m-1)/2)-x^(m*(3*m+1)/2))/product(1-x^i, i=1..m), m=1..20): Gser:=series(G, x=0, 80): seq(coeff(Gser, x^n), n=1..78); # Emeric Deutsch, Mar 29 2005 CROSSREFS Cf. A047993, A025157. Sequence in context: A026829 A025154 A241827 * A264593 A026828 A025153 Adjacent sequences:  A096398 A096399 A096400 * A096402 A096403 A096404 KEYWORD easy,nonn AUTHOR Vladeta Jovovic, Aug 06 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 | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 1 02:47 EDT 2020. Contains 337441 sequences. (Running on oeis4.)