Involving the Multiple Convolution Formula of Fibonacci Number and Lucas Number
Yue Wang
Abstract
Yue Wang
Abstract
In this paper,it was mainly discussed the relationship of recursiveness on the basis of Fibonacci Number {Fn}and Lucas Number{Ln},researched the generating function of ∑∞n=1Fn2 xn and ∑∞n=1Ln2 xn in relation to Fibonacci Number and Lucas Number.Used the Stirling numbers of the first kind and the Stirling numbers of the second kind,got involved in the multiple convolution formula of Fibonacci Number and Lucas Number,generalized W Chu's related conclusions.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper,it was mainly discussed the relationship of recursiveness on the basis of Fibonacci Number {Fn}and Lucas Number{Ln},researched the generating function of ∑∞n=1Fn2 xn and ∑∞n=1Ln2 xn in relation to Fibonacci Number and Lucas Number.Used the Stirling numbers of the first kind and the Stirling numbers of the second kind,got involved in the multiple convolution formula of Fibonacci Number and Lucas Number,generalized W Chu's related conclusions.
Key concepts: Fibonacci number, Lucas number, Fibonacci polynomials, Lucas sequence, Pisano period, Mathematics, Recurrence relation, Convolution (computer science)