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?