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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A026827 Number of partitions of n into distinct parts, the least being 6. 2
0, 0, 0, 0, 0, 0, 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 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,22

LINKS

Table of n, a(n) for n=0..74.

FORMULA

a(n)=A025152(n-6), n>6. - R. J. Mathar, Jul 31 2008

G.f.: x^6*product_{j=7..infinity} (1+x^j). - R. J. Mathar, Jul 31 2008

CROSSREFS

Cf. A025147.

Cf. A025147.

Sequence in context: A025766 A025158 A179046 * A025152 A026802 A185329

Adjacent sequences:  A026824 A026825 A026826 * A026828 A026829 A026830

KEYWORD

nonn

AUTHOR

Clark Kimberling

STATUS

approved

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 May 19 19:20 EDT 2013. Contains 225436 sequences.