login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A025153 Number of partitions of n into distinct parts >= 8. 2
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; internal format)
OFFSET

0,18

FORMULA

a(n)=A026828(n+7). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 31 2008

G.f.: product_{j=8..infinity} (1+x^j). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 31 2008

CROSSREFS

Cf. A025147.

Cf. A025147.

Sequence in context: A025154 A096401 A026828 * A026803 A027192 A194255

Adjacent sequences:  A025150 A025151 A025152 * A025154 A025155 A025156

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

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 .

Last modified February 15 21:56 EST 2012. Contains 205860 sequences.