Calculate the Fibonacci Sequence for n Integers

The result of the following method should calculate the first n integers of the Fibonacci sequence and print that result to the console.

As the Fibonacci sequence is recursive, you may write a recursive algorithm but it is not strictly necessary. Using a standard recursion algorithm would result in an exponential increase in time complexity.