input: Write a function to display a Fibonacci sequence of the first n numbers. If n is less than 1, return an empty list.
  def Fibonacci_sequence(n):
      if n < 1:
          return []
      if 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 Fibonacci_sequence(10) == [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
  assert Fibonacci_sequence(1) == [0]
  assert Fibonacci_sequence(0) == []
  assert Fibonacci_sequence(2) == [0, 1]
output: def Fibonacci_sequence(n):
      if n < 1:
          return []
      if 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