|
Search: id:A008484
|
|
|
| A008484 |
|
Number of partitions of n into parts >= 4. |
|
+0
3
|
|
| 1, 0, 0, 0, 1, 1, 1, 1, 2, 2, 3, 3, 5, 5, 7, 8, 11, 12, 16, 18, 24, 27, 34, 39, 50, 57, 70, 81, 100, 115, 140, 161, 195, 225, 269, 311, 371, 427, 505, 583, 688, 791, 928, 1067, 1248, 1434, 1668, 1914, 2223, 2546
(list; graph; listen)
|
|
|
OFFSET
|
0,9
|
|
|
FORMULA
|
G.f.: Product 1/(1-x^m); m=4..inf.
Given by p(n)-p(n-1)-p(n-2)+p(n-4)+p(n-5)-p(n-6) where p(n)=A000041(n). Generally, 1/product(i=K, oo, 1-x^i) is given by p({A}), where {A} is defined over the coefficients of product(i=1, K-1, 1-x^i). In this case K=4, so (1-x)(1-x^2)(1-x^3)=1-x-x^2+x^4+x^5-x^6, defining {A} as above. G.f.: 1 + sum(i=1, oo, x^4i/product(j=1, i, 1-x^j)) - Jon Perry (perry(AT)globalnet.co.uk), Jul 04 2004
|
|
MAPLE
|
series(1/product((1-x^i), i=4..50), x, 51);
ZL := [ B, {B=Set(Set(Z, card>=4))}, unlabeled ]: seq(combstruct[count](ZL, size=n), n=0..49); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Mar 13 2007
|
|
CROSSREFS
|
Cf. A026797.
Sequence in context: A032230 A126793 A069910 this_sequence A026797 A027189 A140829
Adjacent sequences: A008481 A008482 A008483 this_sequence A008485 A008486 A008487
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
T. Forbes (anthony.d.forbes(AT)googlemail.com)
|
|
|
Search completed in 0.002 seconds
|
