input: Write a function to generate a Fibonacci sequence of the first n numbers. The function should return a list of Fibonacci numbers. If n is 0, the function should return an empty list.
  def Fibonacci_sequence(n):
      if n == 0:
          return []
      elif n == 1:
          return [0]
      elif n == 2:
          return [0, 1]
      else:
          fib_sequence = [0, 1]
          for i in range(2, n):
              fib_sequence.append(fib_sequence[-1] + fib_sequence[-2])
          return fib_sequence
  
  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 []
      elif n == 1:
          return [0]
      elif n == 2:
          return [0, 1]
      else:
          fib_sequence = [0, 1]
          for i in range(2, n):
              fib_sequence.append(fib_sequence[-1] + fib_sequence[-2])
          return fib_sequence