Abstract
In a previous article [2], we found the number of ways to run up a staircase with $n$ steps, where there was no restriction on the size $s$ of each step taken, other than $1\leq s\leq n$ ($n\geq 1$). In this paper, we first answer questions posed in [2], where there are some restrictions on $s$, and then we pose some further questions for the reader.
Citation
Mohammad K. Azarian. "A Generalization of the Climbing Stairs Problem II." Missouri J. Math. Sci. 16 (1) 12 - 17, Winter 2004. https://doi.org/10.35834/2004/1601012
Information
