Can you prove this number theory conjecture?

Question

I think I can prove the following (using a conjecture):

$$ 2n (\sum_{i=2}^n p_i ) \geq p_n(p_n+1)/2 - 6$$

where $p_i$ is the $i$th prime. Can one prove this without any conjecture?