input: 
  def sierpinski_triangle(n): 
      """Generate the first n elements of the Sierpinski triangle.
      >>> sierpinski_triangle(6)
         1  
        1 1 
       1 0 0 1 
      1 1 1 1 1 1 
     1 0 0 0 0 0 0 0 1 
    1 1 0 0 0 0 0 0 1 1 
    >>> sierpinski_triangle(3)
      1  
     1 1 
    1 0 0 1 
    """
      # Drawing lines for first row 
      for i in range(2**n): 
          print(' ', end=" ") 
      
      # loop for printing n rows 
      for i in range(1, n+1): 
          # bit pattern for first and 
          # last line of each row 
          for j in range(2**(i-1), 2**i): 
              print('1', end=" ") 
          print() 
          
          # inner rows have opposite bit pattern 
          if i > 1: 
              for j in range(2**(i-1)+1, 2**i-1):  
                  print('0', end=" ") 
              print()
  
output:     result = []
      for i in range(n):
          row = []
          for j in range(i + 1):
              if j == 0 or j == i:
                  row.append(1)
              else:
                  row.append(result[i - 1][j - 1] + result[i - 1][j])
          result.append(row)
      
      max_width = len(' '.join(map(str, result[-1])))
      for row in result:
          print(' '.join(map(str, row)).center(max_width))