A034141 Number of partitions of n into distinct parts from [1, 11].

1, 1, 1, 2, 2, 3, 4, 5, 6, 8, 10, 12, 14, 16, 19, 22, 25, 28, 32, 35, 39, 43, 46, 49, 53, 56, 59, 62, 64, 66, 68, 69, 69, 70, 69, 69, 68, 66, 64, 62, 59, 56, 53, 49, 46, 43, 39, 35, 32, 28, 25, 22, 19, 16, 14, 12, 10, 8, 6

Offset

0,4

References

Mohammad K. Azarian, A Generalization of the Climbing Stairs Problem II, Missouri Journal of Mathematical Sciences, Vol. 16, No. 1, Winter 2004, pp. 12-17. Zentralblatt MATH, Zbl 1071.05501. - Mohammad K. Azarian, Aug 22 2010

Mohammad K. Azarian, A Generalization of the Climbing Stairs Problem, Mathematics and Computer Education, Vol. 31, No. 1, pp. 24-28, Winter 1997. MathEduc Database (Zentralblatt MATH, 1997c.01891). - Mohammad K. Azarian, Aug 22 2010

Links

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

Formula

G.f.: (1+x)*(1+x^2)*(1+x^3)*...*(1+x^11).

Mathematica

CoefficientList[Series[Times@@(1+x^Range[11]), {x, 0, 60}], x] (* Harvey P. Dale, Jul 10 2012 *)

Crossrefs

Sequence in context: A067596 A114098 A147706 * A055002 A114097 A325855

Adjacent sequences: A034138 A034139 A034140 * A034142 A034143 A034144

Keyword

nonn

Author

N. J. A. Sloane

Status

approved