Created different way to calculate fibonacci sequence

This new function is less memory intensive. It instead of O(n^2), this function is O(n) and has the capability to output the results and an index if desired.

Nothing wrong with the existing one, this is just a different, more efficient implementation