Skip to main content

The Fibonacci Diatomic Array Applied to Fibonacci Representations

  • Conference paper
Applications of Fibonacci Numbers

Abstract

The Fibonacci diatomic array of this paper is a self-generating array which begins with two rows, each containing two 1’s; each row begins and ends with two 1’s. Each interior element in each row is in row (n - 1) or else is the sum of two adjacent elements in row (n - 2), according as the column number is of the form a p or b p , where (a p , b p ) is a Wythoff pair. The Fibonacci diatomic array counts the number of Fibonacci representations R(N) of non-negative integers N. It is also possible to generate the Fibonacci diatomic array from a single row of two 1’s, or to use a single row of two 1’s to generate either the odd rows or the even rows of the array. Both the array of Fibonacci representations and the Fibonacci diatomic array of this paper illustrate many known identities relating to Fibonacci representations while suggesting new identities.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Bicknell-Johnson, M. and Fielder, D.C. “The Number of Representations of N Using Distinct Fibonacci Numbers, Counted by Recursive Formulas.” The Fibonacci Quarterly, Vol. 37.1 (1999) : pp. 47–60.

    MathSciNet  MATH  Google Scholar 

  2. Carlitz, L. “Fibonacci Representations.” The Fibonacci Quarterly, Vol. 6.4 (1968): pp. 193–220.

    MathSciNet  MATH  Google Scholar 

  3. Hoggatt, V.E. Jr. and Bicknell, M. “A Generalization of Wythoff’s Game.” The Fibonacci Quarterly, Vol. 17.3 (1979): pp. 198–211.

    MathSciNet  MATH  Google Scholar 

  4. Horadam, A.F. “Wythoff Pairs.” The Fibonacci Quarterly, Vol. 16.2 (1978): 147–151.

    MathSciNet  MATH  Google Scholar 

  5. Kimberling, C. “The Zeckendorf Array Equals the Wythoff Array.” The Fibonacci Quarterly, Vol. 33.1 (1995): pp. 3–8.

    MathSciNet  MATH  Google Scholar 

  6. Klarner, D.A. “Partitions of N into Distinct Fibonacci Numbers.” The Fibonacci Quarterly, Vol. 6.4 (1968): pp. 235–44.

    MathSciNet  MATH  Google Scholar 

  7. Lang, W. “The Wythoff and the Zeckendorf Representations of Numbers are Equivalent.” Applications of Fibonacci Numbers. Volume 6. Dordrecht: Kluwer, 1996, pp. 321–37.

    Article  Google Scholar 

  8. Sloane, N.J.A. “On-Line Encyclopedia of Integer Sequences.” http://www.research.att.com/~njas/sequences/.

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer Science+Business Media Dordrecht

About this paper

Cite this paper

Bicknell-Johnson, M. (2004). The Fibonacci Diatomic Array Applied to Fibonacci Representations. In: Howard, F.T. (eds) Applications of Fibonacci Numbers. Springer, Dordrecht. https://doi.org/10.1007/978-0-306-48517-6_5

Download citation

  • DOI: https://doi.org/10.1007/978-0-306-48517-6_5

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-6545-2

  • Online ISBN: 978-0-306-48517-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics