This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A096740 Number of partitions of n into distinct parts >= 11. 3
 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 9, 10, 11, 13, 14, 16, 18, 20, 22, 25, 27, 30, 33, 36, 40, 44, 48, 53, 59, 64, 71, 78, 86, 94, 104, 113, 125, 136, 149, 163, 179, 194, 213, 232, 254, 276, 302, 328, 359, 390, 425 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,24 COMMENTS The old entry with this sequence number was a duplicate of A071569. LINKS Alois P. Heinz, Table of n, a(n) for n = 0..1000 FORMULA a(n) = A026831(n+10). - R. J. Mathar, Jul 31 2008 G.f.: product_{j=11..infinity} (1+x^j). - R. J. Mathar, Jul 31 2008 MAPLE b:= proc(n, i) option remember;       `if`(n=0, 1, `if`((i-10)*(i+11)/2 b(n\$2): seq(a(n), n=0..100);  # Alois P. Heinz, Feb 07 2014 MATHEMATICA d[n_] := Select[IntegerPartitions[n], Max[Length /@ Split@#] == 1 && Min[#] >= 11 &]; Table[d[n], {n, 30}] (* str partitions, parts >= 11 *) Table[Length[d[n]], {n, 40}] (* A096740 for n >= 1 *) (* Clark Kimberling, Mar 07 2014 *) b[n_, i_] := b[n, i] = If[n == 0, 1, If[(i-10)*(i+11)/2 < n, 0, Sum[b[n - i*j, i-1], {j, 0, Min[1, n/i]}]]]; a[n_] := b[n, n]; Table[a[n], {n, 0, 100}] (* Jean-François Alcover, Nov 11 2015, after Alois P. Heinz *) CROSSREFS Cf. A025147. Sequence in context: A021895 A025160 A026831 * A264595 A026830 A025155 Adjacent sequences:  A096737 A096738 A096739 * A096741 A096742 A096743 KEYWORD nonn AUTHOR 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 | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.