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

1, 1, 1, 2, 2, 3, 4, 5, 6, 8, 10, 12, 15, 18, 22, 27, 32, 37, 44, 51, 59, 69, 79, 90, 103, 117, 132, 149, 167, 186, 208, 230, 253, 279, 306, 334, 365, 396, 428, 463, 498, 534, 572, 610, 648, 689, 728, 767, 808, 848

Offset

0,4

Comments

The number of different ways to run up a staircase with 16 steps, taking steps of odd sizes (or taking steps of distinct sizes), where the order is not relevant and there is no other restriction on the number or the size of each step taken is the coefficient of x^16. - Mohammad K. Azarian, Aug 22 2010

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, 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).

Links

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

Formula

Expansion of (1+x)(1+x^2)(1+x^3)...(1+x^16).

Crossrefs

Sequence in context: A287997 A352165 A034145 * A287998 A034147 A034148

Adjacent sequences: A034143 A034144 A034145 * A034147 A034148 A034149

Keyword

nonn

Author

N. J. A. Sloane

Status

approved