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 # Output: 2 3 5 7
  assert generate_prime_numbers(20)==None # Output: 2 3 5 7 11 13 17 19
  assert generate_prime_numbers(30)==None # Output: 2 3 5 7 11 13 17 19 23 29
  assert generate_prime_numbers(5)==None # Output: 2 3 5
  assert generate_prime_numbers(0)==None # Output: 
  assert generate_prime_numbers(1)==None # Output:
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)