input: 
  def fibonacci_sequence(n):
      """Output the first n numbers in the Fibonacci sequence as a list of integers.
      >>> fibonacci_sequence(5)
      [0, 1, 1, 2, 3]
      >>> fibonacci_sequence(10)
      [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
      """
      # 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
  
output:     # 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