------
## 最终结论
```python
def cal_sum(n):
    if n < 0:
        return 0
    perrin = [3, 0, 2]
    for i in range(3, n + 1):
        next_perrin = perrin[i - 2] + perrin[i - 3]
        perrin.append(next_perrin)
    return sum(perrin[:n + 1])

# Test cases
assert cal_sum(9) == 49
assert cal_sum(10) == 66
assert cal_sum(11) == 88
```