Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A025152
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A025152 Number of partitions of n into distinct parts >= 7. +0
3
1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 7, 8, 9, 11, 12, 14, 16, 18, 20, 23, 26, 29, 33, 37, 42, 47, 53, 59, 67, 74, 83, 93, 104, 115, 129, 143, 160, 177, 197, 218, 243, 268, 297, 329, 364, 401, 444, 489, 540, 595, 655, 721, 794, 872, 958, 1053, 1156 (list; graph; listen)
OFFSET

0,16

FORMULA

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

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

CROSSREFS

Cf. A025147.

Cf. A025147.

Sequence in context: A025766 A025158 A026827 this_sequence A026802 A029031 A029156

Adjacent sequences: A025149 A025150 A025151 this_sequence A025153 A025154 A025155

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 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research