A034145 - OEIS

A034145

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

1, 1, 1, 2, 2, 3, 4, 5, 6, 8, 10, 12, 15, 18, 22, 27, 31, 36, 43, 49, 57, 66, 75, 85, 97, 109, 122, 137, 152, 168, 186, 203, 222, 243, 263, 285, 308, 330, 353, 378, 401, 425, 450, 473, 496, 521, 542, 564, 586, 605, 624

(list; graph; refs; listen; history; text; internal format)

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..50.

FORMULA

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

CROSSREFS

Sequence in context: A347586 A287997 A352165 * A034146 A287998 A034147

Adjacent sequences: A034142 A034143 A034144 * A034146 A034147 A034148

KEYWORD

nonn

AUTHOR

N. J. A. Sloane

STATUS

approved