A test to see if I could make a somewhat efficient recursive generator for the Fibonacci sequence. Stores already generated numbers and pulls them instead of recalculating when possible. lags for a moment when first calculating very large nth numbers, but once it reaches infinity it will not do that anymore. This is a limitation of scratch, not the calculation method. I just hardcoded it to work with scratch because, and this might surprise you, this project is on scratch.
