You're gonna want:
1. The pow function, to calculate X^N,
2. A function that can compute the Nth factorial.
3. A for loop to iterate through through the pattern you posted.
Split it into checkable parts - first make sure you have a correct factorial(N) function, then work on the pattern inside your for loop, and keep track of it with a sum variable.
Here's a good start: sum += pow(x, N) / factorial(N);
Edit: Yep, as fg109 has pointed out, I agree JLBorges' solution is much better.