|
Search: id:A160974
|
|
|
| A160974 |
|
Number of partitions of n where every part appears at least 4 times |
|
+0
1
|
|
| 0, 0, 0, 1, 1, 1, 1, 2, 1, 2, 1, 4, 2, 4, 4, 7, 5, 8, 7, 13, 10, 13, 12, 21, 18, 22, 21, 34, 29, 40, 36, 55, 48, 63, 64, 88, 79, 100, 99, 139, 125, 160, 155, 207, 199, 241, 241, 314, 302, 369, 366, 466, 454, 550, 557, 690, 679, 807, 821, 1016, 1001, 1180, 1207, 1460, 1466, 1708
(list; graph; listen)
|
|
|
OFFSET
|
1,8
|
|
|
LINKS
|
Ron Hardin, Table of n, a(n) for n=1..967
|
|
FORMULA
|
G.f.=Product(1+x^{4j}/(1-x^j), j=1..infinity). [From Emeric Deutsch (deutsch(AT)duke.poly.edu), Jun 24 2009]
|
|
EXAMPLE
|
a(12)=4 because we have 3333, 2^6, 22221111, and 1^(12). [From Emeric Deutsch (deutsch(AT)duke.poly.edu), Jun 24 2009]
|
|
MAPLE
|
g := product(1+x^(4*j)/(1-x^j), j = 1 .. 30): gser := series(g, x = 0, 85): seq(coeff(gser, x, n), n = 3 .. 66); [From Emeric Deutsch (deutsch(AT)duke.poly.edu), Jun 24 2009]
|
|
CROSSREFS
|
Sequence in context: A161079 A161295 A161270 this_sequence A029196 A051493 A029173
Adjacent sequences: A160971 A160972 A160973 this_sequence A160975 A160976 A160977
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Ron Hardin (rhhardin(AT)att.net) Jun 01 2009
|
|
EXTENSIONS
|
Initial terms changed to match b-file. - N. J. A. Sloane, Aug 31 2009
|
|
|
Search completed in 0.002 seconds
|
