Well, of course my favorite is Stokes theorem (it used to be the background of my mobile in the old days where you still manually designed monochromatic backgrounds pixel by pixel), but that is already suggested. And so are many others. So I'll go for Kontsevich formula for the number $N_d$ of rational curves through $3d-1$ generic points in the plane:
$N_d + \sum_{\stackrel{d_A, d_B \geq 1}{d_A + d_B = d}} \binom{3d - 4}{3 d_A - 1} N_{d_A} N_{d_B} d_A^3 d_B = \sum_{\stackrel{d_A, d_B \geq 1}{d_A + d_B = d}} \binom{3d - 4}{3 d_A - 2} N_{d_A} N_{d_B} d_A^2 d_B^2$
Although I admit this looks ugly until you see the proof. Then it becomes so neat!