This paper investigated how many different ways an $m$-rung staircase can be climbed within certain rules. It was observed that the climbing numbers of the stairs are related to the Catalan numbers. The combinatorics problem discussed in this article is different from the ones done so far and is related not only to Catalan numbers but also to some Fuss-Catalan numbers. Some results regarding the climbing numbers were obtained. It was observed that with the initial ascent being fixed, the climbing numbers of stairs with $m, m+1, m+2, m+3$, ... rungs, where $m>1$ is an integer, are related to respectively some Fuss-Catalan numbers.
FBA-2023-38876
FBA-2023-38876
Primary Language | English |
---|---|
Subjects | Applied Mathematics (Other) |
Journal Section | Articles |
Authors | |
Project Number | FBA-2023-38876 |
Early Pub Date | December 10, 2024 |
Publication Date | |
Submission Date | October 3, 2024 |
Acceptance Date | November 18, 2024 |
Published in Issue | Year 2025 Volume: 13 Issue: 1 |
The published articles in MSAEN are licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.