Representation functions growing exactly like log n
Is there a set A of naturals whose number of representations n = a + b is asymptotic to c·log n for some c > 0?
Comparing changes
Choose two branches to see what changed, then open a pull request to bring the work across.
Pick two different branches
A pull request can go from any branch into any other.