human
Pierpont Prime | Python3 program to print Pierpont prime numbers smaller than n ..
Finding all numbers having factor power of 2 and 3 Using sieve.
Storing number of the form 2 ^ i . 3 ^ k + 1..
Finding prime number using sieve of Eratosthenes . Reusing same array as result of above computations in v ..
Printing n pierpont primes smaller than n.
Driver Code"
Solution in Python:

Write me a code to pierpont Prime and the other steps required?
assistant
#Here is code to pierpont Prime and the other steps required.
 def printPierpont ( n ) :
	arr = [ False ] * ( n + 1 ) ;
	two = 1 ;
	three = 1 ;
	while ( two + 1 < n ) :
		arr [ two ] = True ;
		while ( two * three + 1 < n ) :
			arr [ three ] = True ;
			arr [ two * three ] = True ;
			three *= 3 ;
		three = 1 ;
		two *= 2 ;
	v = [ ] ;
	for i in range ( n ) :
		if ( arr [ i ] ) :
			v . append ( i + 1 ) ;
	arr1 = [ False ] * ( len ( arr ) ) ;
	p = 2 ;
	while ( p * p < n ) :
		if ( arr1 [ p ] == False ) :
			for i in range ( p * 2 , n , p ) :
				arr1 [ i ] = True ;
		p += 1 ;
	for i in range ( len ( v ) ) :
		if ( not arr1 [ v [ i ] ] ) :
			print ( v [ i ] , end = " ▁ " ) ;
n = 200 ;
printPierpont ( n ) ;