title: Piramidial representation of constant numbers like pi, euler, golden ratio
body: <p>I can't find it on the internet but a piramidial representation of a constant goes as follows:</p>
  <p>There are n rows, nummered from top to bottom, on the i-th floor (i = 1, 2, ... , n) are an i amount of numbers and each number is the sum of the next i numbers in the constant.</p>
  <p><a href="https://i.stack.imgur.com/xqks9.png" rel="nofollow noreferrer">example of a piramidial representation for pi with 5 rows</a></p>
  <p>We get the constant and the amount of rows as input and we then need this pyramid as output.
  I know I have to use 2 for-loops but I get really confused with how I should use them.</p>
  <pre><code>cte = input()
  verdiep = int(input())
  for i in range(1, verdiep+1):
      pyramid = 0
      rij = ''
      for sum in range(i, len(cte)):
          if cte[i] != '.':
              pyramid += int(cte[i])
              rij += str(pyramid)
      print(rij)
  </code></pre>
  <p>This is my code so far, I know I shouldn't use in range(i, len(cte)) in my 2nd for-loop but I have no idea how to do this without going to 3 for loops because then I think my program just crashes because it takes too long. How do I get the index for my constant?</p>