Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A025154
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A025154 Number of partitions of n into distinct parts >= 9. +0
3
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; listen)
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 this_sequence A096401 A026828 A025153

Adjacent sequences: A025151 A025152 A025153 this_sequence A025155 A025156 A025157

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 11 12:57 EST 2009. Contains 170656 sequences.


AT&T Labs Research