How to Create Fibonacci Sequence in LibreOffice


Here’s how you can create a Fibonacci sequence in LibreOffice or OpenOffice Calc.

LibreOffice Calc is a spreadsheet application that is part of the LibreOffice office suite. It is similar to Microsoft Excel and can be used to perform a wide variety of tasks, including data analysis, financial calculations, and creating charts and graphs.

Fibonacci Sequence

The Fibonacci sequence is a series of numbers in which each number is the sum of the two preceding ones, starting from 0 and 1. So, the sequence goes 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, and so on.

Creating a Fibonacci Sequence in LibreOffice Calc

To create a Fibonacci sequence in LibreOffice Calc, follow these steps:

  1. Open LibreOffice Calc.
  2. In cell A1, enter the number 0.
  3. In cell A2, enter the number 1.
  4. In cell A3, enter the formula =A1 + A2.
  5. Copy the formula or use the cell handle to fill in cell A3 to the cells below it.
  6. The Fibonacci sequence will be displayed in the cells A1, A2, A3, and so on.


For example, if you want to create the Fibonacci sequence up to the 10th number, you would copy the formula in cell A3 to cells A4 through A10. The Fibonacci sequence would then be displayed in cells A1 through A10.

Fibonacci sequence in LibreOffice Calc
Fibonacci sequence in LibreOffice Calc


The Fibonacci sequence is named after Leonardo Fibonacci, an Italian mathematician who introduced the sequence to Western European mathematics in his 1202 book Liber Abaci. The sequence was described as “particularly ingenious” by Fibonacci, and he demonstrated its use in algorithms for the Indian numeral system.

Mathematicians have studied the Fibonacci sequence for centuries, and it has been found to have applications in various fields, including art, architecture, and music.

Additional Notes

  • The Fibonacci sequence can also be generated using the following recursive formula:
F(n) = F(n-1) + F(n-2)

where F(n) is the nth number in the sequence.

  • The Fibonacci sequence is a perfect example of a recursive formula. In a recursive formula, a function is defined in terms of itself.
  • The Fibonacci sequence is also a good example of a dynamic programming problem. In dynamic programming, a problem is solved by breaking it down into smaller subproblems. The solutions to the subproblems are then used to solve the original problem.


The Fibonacci sequence is a fascinating mathematical concept with a long and rich history. It is a simple sequence to generate, but it has many interesting properties and applications.

Join our Telegram channel and stay informed on the move.

Notify of

This site uses Akismet to reduce spam. Learn how your comment data is processed.

Inline Feedbacks
View all comments