|
Search: id:A102424
|
|
|
| A102424 |
|
Number of partitions of n with each part p <= 5 and each part's multiplicity m <= 5. |
|
+0
1
|
|
| 1, 1, 2, 3, 5, 7, 9, 12, 16, 20, 25, 30, 36, 43, 50, 58, 66, 75, 84, 94, 104, 114, 124, 135, 145, 156, 165, 175, 184, 193, 201, 208, 214, 220, 224, 228, 230, 231, 231, 228, 224, 220, 214, 208, 201, 193, 184, 175, 165, 156, 145, 135, 124, 114, 104, 94, 84, 75, 66, 58, 50
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
There are only 76 nonzero terms.
|
|
LINKS
|
Thomas Wieder, Home Page.
Thomas Wieder, (Old) Home Page.
|
|
EXAMPLE
|
a(7)=12 because we can write 7=1+1+1+1+1+2, 1+1+1+2+2, 1+2+2+2, 1+1+1+1+3, 1+1+2+3, 2+2+3, 1+3+3, 1+1+1+4, 1+2+4, 3+4, 1+1+5, 2+5. Not allowed are: 1+1+1+1+1+1+1, 16, 7.
|
|
MAPLE
|
g:=product(sum(z^(p*m), m=0..5), p=1..5): series(g, z=0, 80);
|
|
CROSSREFS
|
Cf. A102420 = number of partitions of integer n with exactly k = 5 parts and each part p <= 5.
Cf. A000041, A102420.
Sequence in context: A039825 A126256 A062438 this_sequence A080000 A032459 A028870
Adjacent sequences: A102421 A102422 A102423 this_sequence A102425 A102426 A102427
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Thomas Wieder (wieder.thomas(AT)t-online.de), Jan 09 2005
|
|
EXTENSIONS
|
Edited by N. J. A. Sloane (njas(AT)research.att.com), Sep 15 2006
|
|
|
Search completed in 0.002 seconds
|
