<abstract xmlns="http://www.w3.org/1999/xhtml"><p>In this paper we investigate Fibonacci type sequences defined by kth order linear recurrence. Based on their companion matrix and its graph interpretation we determine multinomial and binomial formulas for these sequences. Moreover we present a graphical rule for calculating the words of these sequences from the Pascal’s triangle.</p></abstract>

In this paper we investigate Fibonacci type sequences defined by kth order linear recurrence. Based on their companion matrix and its graph interpretation we determine multinomial and binomial formulas for these sequences. Moreover we present a graphical rule for calculating the words of these sequences from the Pascal’s triangle.

On Some Multinomial Sums Related to the Fibonacci Type Numbers

Tatra Mountains Mathematical Publications

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

{"article-title":"On Some Multinomial Sums Related to the Fibonacci Type Numbers"}

In this paper we investigate Fibonacci type sequences defined by kth order linear recurrence. Based on their companion matrix and its graph interpretation we...

On Some Multinomial Sums Related to the Fibonacci Type Numbers

Published Online: Dec 31, 2020

Page range: 99 - 108

Received: Mar 31, 2020

DOI: https://doi.org/10.2478/tmmp-2020-0035

Keywords
Fibonacci numbers, recurrence, multinomial formulas

© 2020 Iwona Włoch et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

On Some Multinomial Sums Related to the Fibonacci Type Numbers

Published Online: Dec 31, 2020

Page range: 99 - 108

Received: Mar 31, 2020

DOI: https://doi.org/10.2478/tmmp-2020-0035

KeywordsFibonacci numbers, recurrence, multinomial formulas

© 2020 Iwona Włoch et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Keywords
Fibonacci numbers, recurrence, multinomial formulas