[seqfan] Re: Sum of a binary power and an odd prime power
Ray Chandler
rayjchandler at sbcglobal.net
Sat Apr 17 15:48:42 CEST 2010
I like your description better, but I think j>=0 is more consistent with A061345.
I can send you what I computed, but would like to have the author join the discussion to see if I've missed his intent.
Sequences A115231-233 are consistent with the terms of A115230 as listed.
Ray
> 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
More information about the SeqFan
mailing list