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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A025154 Number of partitions of n into distinct parts >= 9. 2
1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 8, 9, 10, 12, 13, 15, 17, 19, 21, 24, 26, 29, 33, 36, 40, 45, 50, 55, 62, 68, 76, 84, 93, 102, 114, 125, 138, 152, 168, 184, 204, 223, 246, 270, 297, 325, 358, 391, 429, 470, 515, 562, 616, 672, 735 (list; graph; refs; listen; history; internal format)
OFFSET

0,20

FORMULA

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

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

CROSSREFS

Cf. A025147.

Cf. A025147.

Sequence in context: A111684 A025159 A026829 * A096401 A026828 A025153

Adjacent sequences:  A025151 A025152 A025153 * A025155 A025156 A025157

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 16:28 EST 2012. Contains 205823 sequences.