Infinitely Often Dense Bases for the Integers with a Prescribed Representation Function

Nathanson constructed asymptotic bases for the integers with prescribed representation functions, then asked how dense they can be. We can easily obtain an upper bound using a simple argument. In this paper, we will see this is indeed the best bound when we prescribe an arbitrary representation function.