
handle: 11499/9060
Many authors define certain generalizations of the usual Fibonacci, Pell and Lucas numbers by matrix methods and then obtain the Binet formulas and combinatorial representations of the generalizations of these number sequence. In this article firstly we define and study the generalized Gaussian Fibonacci numbers and then find the matrix representation of the Generalized Gaussian Fibonacci numbers and prove some theorems by these matrix representations. © Copyright 2017, Charles Babbage Research Centre. All rights reserved.
Gaussian Fibonacci sequence, Gaussian Lucas sequence, Generalized Gaussian Fibonacci sequence, 510, 004, Gaussian Fibonacci sequence; Gaussian Lucas sequence; Generalized
Gaussian Fibonacci sequence, Gaussian Lucas sequence, Generalized Gaussian Fibonacci sequence, 510, 004, Gaussian Fibonacci sequence; Gaussian Lucas sequence; Generalized
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
