[seqfan] Re: Sum of a binary power and an odd prime power

[N. J. A. Sloane]

Concerning A115230 - A115233:  

Ray suggests that a better definition would be (I changed it slightly):

%N A115230 a(n) = number of ways to write the n-th prime as 2^i + q^j
where i >= 0, q is an odd prime and j >= 1 (cf. A000079, A061345).

This seems reasonable.  Could someone compute
correct versions of the 4 sequences?  That seems
better than deleting them.

Thanks

Neil