This site is supported by donations to The OEIS Foundation.

 Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS". Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A034147 Number of partitions of n into distinct parts from [ 1, 17 ]. 0
 1, 1, 1, 2, 2, 3, 4, 5, 6, 8, 10, 12, 15, 18, 22, 27, 32, 38, 45, 52, 61, 71, 82, 94, 108, 123, 140, 159, 179, 201, 226, 252, 280, 311, 343, 378, 416, 455, 497, 542, 588, 637, 689, 742, 797, 856, 914, 975, 1038, 1101 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 COMMENTS The number of different ways to run up a staircase with 17 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^17. - 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 FORMULA Expansion of (1+x)(1+x^2)(1+x^3)...(1+x^17). CROSSREFS Sequence in context: A034145 A034146 A287998 * A034148 A288000 A034149 Adjacent sequences:  A034144 A034145 A034146 * A034148 A034149 A034150 KEYWORD nonn AUTHOR STATUS approved

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