No label defined (Q4672139)

The Riccati differential equation is \[ f(x)G'(x)=f_0(x)G^2(x)+f_1(x)+f_2(x), \] where \(f_0(x)\not\equiv 0\). In this case, \(G^2(x)=\alpha(x)G'(x)- \beta(x)G(x)-\gamma(x)\), where \(\alpha(x),\beta(x)\) and \(\gamma(x)\) are obtained by dividing \(f(x),~f_1(x)\) and \(f_2(x)\), respectively, by \(f_0(x)\). In particular, when the coefficient functions \(\alpha(x),~\beta(x)\) and \(\gamma(x)\) are simple, for example, when they are polynomials, one can compute the convolution \(\{G_n^{(1)}\}_{n\geq 0}\) of \(\{G_n\}_{n\geq 0}\) with itself, defined as \(G_n^{(1)}=\sum_{k=0}^n G_kG_{n-k}\), by simply applying the above formula to the generating function \(G(x)=\sum_{n\geq 0} G_n x^n\) of the sequence \(\{G_n\}_{n\geq 0}\). This program is carried out in this paper for several examples obeying the additional condition \(\gamma(x)=0\) (the so-called \textit{Bernoulli type}). It is shown how generalized Fibonacci and Lucas numbers are generated by functions which satisfy a Riccati equation of the above type. The author also discusses resulting expressions for higher convolutions of such sequences. At the end of the paper, he extends this method to even more general linearly recurrent sequences such as the so-called generalized \(p\)-Fibonacci numbers.