Space Slicing

I also looked at the Space Slicing problem. It seems deceptively simple; as with no lines, there is one region, with one there are two, with two there are four, and with three there are seven. With R(n) being the number of regions in the space divided by n lines, R(0) = 1 and R(n) = R(n-1) + n for n <= 1. I feel like I could be wrong though as this seems too easy.