Skip to main content
SpringerLink
Log in

Sums of products of generalized Fibonacci and Lucas numbers

  • Published:
Acta Mathematica Hungarica Aims and scope Submit manuscript

Abstract

Sums of products of a fixed number of Fibonacci(-type) numbers can be computed automatically. This extends, at least in principle, various results about two factors that appeared in the literature. More general results (with an arbitrary number of factors) where then guessed and eventually proved by traditional (“human”) methods.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. G. E. Andrews, R. Askey and R. Roy, Special Functions, Cambridge University Press (2000).

  2. H. W. Gould, The bracket function and Fountené–Ward generalized binomial coefficients with application to Fibonomial coefficients, The Fibonacci Quarterly, 7 (1969), 23–40.

  3. V. E. Hoggatt Jr., Fibonacci numbers and generalized binomial coefficients, The Fibonacci Quarterly, 5 (1967), 383–400.

  4. E. Kilic, N. Ömür and Y. Ulutas, Binomial sums whose coefficients are products of terms of binary sequences, Utilitas Mathematica, 84 (2011), 45–52.

  5. Kilic E.: Sums of the squares of terms of sequence {u n }. Proc. Indian Acad. Sci., 118, 27–41 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  6. M. Kauers and B. Zimmermann, Computing the algebraic relations of C-finite sequences and multisequences, J. Symbolic Comput., 43 (2008), 787–803.

  7. T. Koshy, Fibonacci and Lucas Numbers with Applications, Pure and Applied Mathematics, Wiley-Interscience (New York, 2001).

  8. Melham R. S.: On sums of powers of terms in a linear recurrence. Portugal. Math., 56, 501–508 (1999)

    MATH  MathSciNet  Google Scholar 

  9. I. Nemes and M. Petkovs̆ek, RComp: a Mathematica package for computing with recursive sequences, J. Symbolic Comput., 20 (1995), 745–753.

  10. K. S. Rao, Some properties of Fibonacci numbers, The Amer. Math. Monthly, 60 (1953), 680–684.

  11. S. Vajda, Fibonacci & Lucas Numbers, and the Golden Section, John Wiley & Sons, Inc. (New York, 1989).

Download references

Author information

Authors and Affiliations

  1. Mathematics Department, TOBB University of Economics and Technology, 06560, Ankara, Turkey

    E. Kilic

  2. Department of Mathematics, University of Stellenbosch, 7602, Stellenbosch, South Africa

    H. Prodinger

Authors
  1. E. Kilic
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. H. Prodinger
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to E. Kilic.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kilic, E., Prodinger, H. Sums of products of generalized Fibonacci and Lucas numbers. Acta Math. Hungar. 145, 17–25 (2015). https://doi.org/10.1007/s10474-014-0473-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10474-014-0473-6

Keywords and phrases

Mathematics Subject Classification

Search

Navigation