input: Write a function to generate a prime number sequence using Python.
  def generate_prime_numbers(n):
      primes = [True for i in range(n + 1)]
      p = 2
      while (p * p <= n):
          if (primes[p] == True):
              for i in range(p * p, n + 1, p):
                  primes[i] = False
          p += 1
      primes[0] = False
      primes[1] = False
      for p in range(n + 1):
          if primes[p]:
              print(p)
  
  assert generate_prime_numbers(10) == None
  assert generate_prime_numbers(20) == None
  assert generate_prime_numbers(30) == None
  assert generate_prime_numbers(50) == None
  assert generate_prime_numbers(100) == None
output: def generate_prime_numbers(n):
      primes = [True for i in range(n + 1)]
      p = 2
      while (p * p <= n):
          if (primes[p] == True):
              for i in range(p * p, n + 1, p):
                  primes[i] = False
          p += 1
      primes[0] = False
      primes[1] = False
      for p in range(n + 1):
          if primes[p]:
              print(p)