Steps Problem: The Link Between Combinatoric and K-Bonacci Sequences

Abstract

In this paper we generalized the combinatorial formula for k-bonacci numbers where k is a positive integer by using the well-known step problem. We solved this problem using the combinatorial analysis. We established the relationship between the combinatorial analysis and the famous Fibonacci sequences. We extended our analysis to the case of taking 1 or 2 or 3 or 4 up to k steps at a time, which allowed us to derive a combinatorial equivalent of k-bonacci numbers

Keywords: Combinatoric., K-bonacci, Sequences


Article Review Status: Published

Pages: 10-19 (Download PDF)

Creative Commons Licence
This work by European American Journals is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License