Maths - Fibonacci Series Generator

Show/Hide:DefinitionsFormulae Instructions


This page allows you to quickly generate the first elements of the classic Fibonacci series. You may choose between a numbered list, or an unformatted sequence of results. Both will have exactly the same entries. Please note that beyond 103 values, the standard precision of your computer will start to display in 'Exponential' notation. At 1,478 iterations, the series will reach infinity as far as Javascript is concerned. Both of these situations are a direct result of the built-in numbering handling of your browser. If you need more precision and/or larger numbers, then use the Expanded Fibonacci Series generator, which will retain full precision (almost) infinitely, but this comes at the price of significantly slower operation.
Click on any of the links at the top of the page to reveal (or hide) more information about this calculator.


If you are reading this paragraph, then you probably don't have JavaScript installed/enabled on your computer.
At this point in time the calculators on this site are entirely dependent on JavaScript. Given enough time and money it is hoped to develop a version in the future which will be able to operate independently. Since JavaScript runs on your own computer, rather than on this server, it has been possible to set up this site much more quickly than if a server-side language was used, and it is possible to serve far more pages with the available bandwidth.
If you think that you can assist with this project in any way, then please visit the Support section and leave a message.




The classic Fibonacci sequence can be defined as: n[x] = n[x-1] + n[x-2]
Where: n[0] = 0 and n[1] = 1


If you change the 'Number of entries to generate' box, after a list has been generated, the original list will be expanded from where it previously finished.
If you have a very old computer, and choose to calculate a long list, the system may become temporarily unresponsive. If this proves problematic, choose a small number first, then increase gradually. Only new values will be created each time.


© Copyright Mike Brockington 2004 - 2015   All Rights Reserved