Generating Fibonacci numbers

You might be asking yourself what Fibonacci numbers are. What we're talking about is a sequence of numbers generated recursively (that means through repeated computations). Each new Fibonacci number is computed by summing the previous two numbers. The set begins with 0 and 1, and then builds from there.

If we compute the first few ourselves, we'd have:

Third number = First number + Second number = 0 + 1 = 1

This leads to the sequence 0, 1, 1, 2, 3, 5, 8, 13, 21, …

Getting ready

We can see that generating these Fibonacci numbers can be a tedious task, particularly if we wanted to generate a lot of them. Luckily, we can use Scratch to generate as many Fibonacci numbers as we want.

Here, we will create a program that will do that for us (generating a maximum of 1,000 Fibonacci numbers). The output of these numbers will be a list of all Fibonacci numbers generated.

How to do it...

Follow these steps to work through this recipe:

1. Open a new Scratch file.

2. Create a new variable...