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?
Pull requests
Pull requests bring work from one route into another; merging one adopts it.
No open pull requests
Pull requests bring work from one branch into another.