input: Write a function to generate a Fibonacci sequence of the first n numbers. The function should return a list containing the Fibonacci sequence. If n is less than or equal to 0, return an empty list.
  def Fibonacci(n):
      if n <= 0:
          return []
      elif n == 1:
          return [0]
      elif n == 2:
          return [0, 1]
      else:
          fib_seq = [0, 1]
          for i in range(2, n):
              fib_seq.append(fib_seq[-1] + fib_seq[-2])
          return fib_seq
  
  assert Fibonacci(5)==[0, 1, 1, 2, 3]
  assert Fibonacci(10)==[0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
  assert Fibonacci(1)==[0]
  assert Fibonacci(0)==[]
  assert Fibonacci(-3)==[]
output: def Fibonacci(n):
      if n <= 0:
          return []
      elif n == 1:
          return [0]
      elif n == 2:
          return [0, 1]
      else:
          fib_seq = [0, 1]
          for i in range(2, n):
              fib_seq.append(fib_seq[-1] + fib_seq[-2])
          return fib_seq