4

I don't want to invoke any of the sophisticated methods that have been found (see the article linked in the other answer), not even the pentagonal number theorem. I just want to say that the most straightforward way of computing the values of $p(n)$ for all $n\leq N$ requires only $O(N^2)$ additi...