European Journal of Statistics and Probability (EJSP)

EA Journals

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

cc logo

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

 

Recent Publications

Email ID: submission@ea-journals.org
Impact Factor: 6.90
Print ISSN: 2055-0154
Online ISSN: 2055-0162
DOI: https://doi.org/10.37745/ejsp.2013

Author Guidelines
Submit Papers
Review Status

 

Scroll to Top

Don't miss any Call For Paper update from EA Journals

Fill up the form below and get notified everytime we call for new submissions for our journals.