This site is supported by donations to The OEIS Foundation.

 Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS". Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A025153 Number of partitions of n into distinct parts >= 8. 3
 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 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, 29, 33, 36, 41, 46, 51, 57, 64, 71, 79, 88, 97, 109, 120, 133, 147, 164, 180, 200, 220, 244, 268, 297, 325, 360, 395, 435, 477, 526, 575, 633, 693, 761, 832, 913 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,18 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..1000 FORMULA a(n) = A026828(n+7). - R. J. Mathar, Jul 31 2008 G.f.: product_{j=8..infinity} (1+x^j). - R. J. Mathar, Jul 31 2008 MAPLE b:= proc(n, i) option remember;       `if`(n=0, 1, `if`((i-7)*(i+8)/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[#] >= 8 &]; Table[d[n], {n, 20}] (* strict partitions, parts >= 8 *) Table[Length[d[n]], {n, 40}] (* A025153 for n >= 1 *) (* Clark Kimberling, Mar 07 2014 *) CROSSREFS Cf. A025147. Sequence in context: A096401 A264593 A026828 * A026803 A286041 A027192 Adjacent sequences:  A025150 A025151 A025152 * A025154 A025155 A025156 KEYWORD nonn AUTHOR 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.