Python Fibonacci Function

Hulu experiments may use Fibonacci-sized batches when generating sample positions for a recommendation surface. Given a nonnegative integer n, return the first n values of the Fibonacci sequence, starting with 0 and 1.

The sequence is defined as F(0) = 0, F(1) = 1, and F(k) = F(k - 1) + F(k - 2) for k >= 2.

Formal Specification

Implement fibonacci_sequence(n), where:

1. n is an integer representing the number of values to return.
2. Return a list containing exactly n Fibonacci values.
3. Return an empty list when n is 0.
4. Use an iterative approach rather than recomputing earlier values recursively.

Python integers may grow beyond fixed-width limits, so return the exact values generated by Python integer arithmetic.