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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A025151 Number of partitions of n into distinct parts >= 6. 2
1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 7, 7, 9, 10, 12, 13, 16, 17, 20, 23, 26, 29, 34, 38, 43, 49, 55, 62, 70, 79, 88, 100, 111, 125, 140, 157, 174, 196, 217, 243, 270, 301, 333, 372, 411, 457, 506, 561, 619, 687, 757, 837, 924, 1019, 1122, 1238, 1361, 1498 (list; graph; refs; listen; history; internal format)
OFFSET

0,14

FORMULA

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

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

CROSSREFS

Cf. A025147.

Cf. A025147.

Sequence in context: A188666 A029156 A026826 * A026801 A185328 A027191

Adjacent sequences:  A025148 A025149 A025150 * A025152 A025153 A025154

KEYWORD

nonn,easy

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 17 18:41 EST 2012. Contains 206074 sequences.