
The Fibonacci polynomials are a polynomial sequence that can be considered as a generalization of the Fibonacci numbers. Fibonacci polynomials are defined by a recurrence relation: Fnx=xFn−1x+Fn−2x,n≥2 where F0=0,F1=1. The first few Fibonacci polynomials are F0=0, F0x=0, F1x=1, F2x=x, F3x=x2+1. In this chapter, we extend the Fibonacci recurrence relation to define the sequence {Kn} and will derive some properties of this sequence. We also define four comparison sequences {Pn}, {Qn}, {Rn}, and {Sn} and obtain some identities with the help of generating matrix.
| 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 |
