input: Write a function to generate and display a Fibonacci sequence of the first n numbers. The function should return the nth Fibonacci number. If n is 1, it should return 0. If n is 2, it should return 1. For other values of n, it should return the sum of the (n-1)th and (n-2)th Fibonacci numbers.
  
  def Fibonacci(n):
      if n == 1:
          return 0
      elif n == 2:
          return 1
      else:
          return Fibonacci(n-1) + Fibonacci(n-2)
  
  n = 10
  for i in range(1, n+1):
      print(Fibonacci(i))
  
  assert Fibonacci(1) == 0
  assert Fibonacci(2) == 1
  assert Fibonacci(5) == 3
  assert Fibonacci(8) == 13
output: def Fibonacci(n):
      if n == 1:
          return 0
      elif n == 2:
          return 1
      else:
          return Fibonacci(n-1) + Fibonacci(n-2)