Domain: academics (Mathematical and Algorithmic Computation)
Problem: I am currently working on this math problem: Let the figure correspond to the n-th iteration of the Sierpiński triangle. Calculate the sum of the number of smallest triangles from the 0-th iteration to the (n+1)-th iteration, and output the integer S.
Answer: 9841