A Synthesis of Certain Polynomial Sequences

  • A. F. Horadam

Abstract

Encouraged by the comments of the reviewer [1] of my earlier article [4], I now take the opportunity to extend the material in [4] to incorporate some new thoughts on general recursively-defined polynomial sequences of the second order.

Keywords

Number Sequence Recurrence Formula Early Article Numerical Sequence Polynomial Sequence 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Filipponi, P. (Review) Mathematical Reviews., 94f#11007.Google Scholar
  2. [2]
    Horadam, A.F. “VBasic Properties of a Certain Generalized Sequence of Numbers”. The Fibonacci Quarterly, Vol. 3.3 (1965): pp. 161–176.MathSciNetMATHGoogle Scholar
  3. [3]
    Horadam, A.F. “Chebyshev and Fermat Polynomials for Diagonal Functions”. The Fibonacci Quarterly, Vol. 17.4 (1979): pp. 328–333.MathSciNetGoogle Scholar
  4. [4]
    Horadam, A.F. “Associated Sequences of General Order”. The Fibonacci Quarterly, Vol. 31.2 (1993): pp. 166–172.MathSciNetGoogle Scholar
  5. [5]
    Horadam, A.F. & Br. Mahon, J.M. “Pell and Pell-Lucas Polynomials”. The Fibonacci Quarterly, Vol. 23.1 (1985): pp. 7–20.MathSciNetGoogle Scholar
  6. [6]
    Lucas, E. Théorie des Nombres. Blanchard, Paris (1961).MATHGoogle Scholar

Copyright information

© Kluwer Academic Publishers 1996

Authors and Affiliations

  • A. F. Horadam

There are no affiliations available

Personalised recommendations