input: Write a function to output the Fibonacci sequence as a list of integers in Python. The function takes an integer n as input and returns a list of the first n Fibonacci numbers. If n is 0, the function should return an empty list.
  
  def fibonacci_sequence(n): 
      if n == 0:
          return []
      fib_list  = [0]*n 
      fib_list[0] = 0
      if n > 1:
          fib_list[1] = 1
      for i in range(2, n): 
          fib_list[i] = fib_list[i-1] + fib_list[i-2] 
      return fib_list
  
  assert fibonacci_sequence(0) == []
  assert fibonacci_sequence(1) == [0]
  assert fibonacci_sequence(2) == [0, 1]
  assert fibonacci_sequence(5) == [0, 1, 1, 2, 3]
  assert fibonacci_sequence(10) == [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
output: def fibonacci_sequence(n): 
      if n == 0:
          return []
      fib_list  = [0]*n 
      fib_list[0] = 0
      if n > 1:
          fib_list[1] = 1
      for i in range(2, n): 
          fib_list[i] = fib_list[i-1] + fib_list[i-2] 
      return fib_list