input: Write a function to generate and display a Fibonacci sequence of the first n numbers. If n is 1, the sequence should be [0]. If n is 2, the sequence should be [0, 1]. For n greater than 2, the sequence should follow the Fibonacci rule, where each number is the sum of the previous two numbers.
  
  def FibonacciSequence(n):
      if n <= 0:
          return []
      elif n == 1:
          return [0]
      elif n == 2:
          return [0, 1]
      else:
          sequence = [0, 1]
          for i in range(2, n):
              sequence.append(sequence[-1] + sequence[-2])
          return sequence
  
  assert FibonacciSequence(1) == [0]
  assert FibonacciSequence(2) == [0, 1]
  assert FibonacciSequence(10) == [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
  assert FibonacciSequence(0) == []
  assert FibonacciSequence(5) == [0, 1, 1, 2, 3]
output: def FibonacciSequence(n):
      if n <= 0:
          return []
      elif n == 1:
          return [0]
      elif n == 2:
          return [0, 1]
      else:
          sequence = [0, 1]
          for i in range(2, n):
              sequence.append(sequence[-1] + sequence[-2])
          return sequence