input: Write a function to generate the Fibonacci sequence as a list of integers in Python. The function should take an integer n as input and return a list of the first n Fibonacci numbers.
  
  def fibonacci_sequence(n):
      # Creating list of length n
      fib_list = [0]*n
        
      # first and second terms
      fib_list[0] = 0
      fib_list[1] = 1
        
      # Application of the recursive algorithm
      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]
output: def fibonacci_sequence(n):
      if n == 0:
          return []
      elif n == 1:
          return [0]
      fib_list = [0, 1]
      for i in range(2, n):
          fib_list.append(fib_list[-1] + fib_list[-2])
      return fib_list