The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A034139 Number of partitions of n into distinct parts from [ 1, 9 ]. 1
 1, 1, 1, 2, 2, 3, 4, 5, 6, 8, 9, 10, 12, 13, 15, 17, 18, 19, 21, 21, 22, 23, 23, 23, 23, 22, 21, 21, 19, 18, 17, 15, 13, 12, 10, 9, 8, 6, 5, 4, 3, 2, 2, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 COMMENTS The number of different ways to run up a staircase with 9 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^9. - 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, 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..69. FORMULA Expansion of (1+x)(1+x^2)(1+x^3)...(1+x^9). CROSSREFS Sequence in context: A165686 A025209 A125573 * A238886 A060620 A109968 Adjacent sequences: A034136 A034137 A034138 * A034140 A034141 A034142 KEYWORD nonn AUTHOR N. J. A. Sloane STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 9 07:24 EDT 2024. Contains 375762 sequences. (Running on oeis4.)