I'm not sure how to tell what's NP-complete. But what about determining the sequence emerging from a recent math-fun discussion: B(n) = [# of subsets of the n nth roots of unity that sum to 0], up to isometry. (A naive brute-force check would involve

2^n / #(D_n) = 2^(n-1) / n sums for each n.)

--Dan