A155860 Number of ways to write 2n-1 as p + 2^x + 3*2^y with p an odd prime and x,y positive integers.
Examples
For n=10 the a(10)=4 solutions are 19 = 3 + 2^2 + 3*2^2 = 5 + 2 + 3*2^2 = 5 + 2^3 + 3*2 = 11 + 2 + 3*2.
References
- R. Crocker, On a sum of a prime and two powers of two, Pacific J. Math. 36(1971), 103-107.
- Z.-W. Sun and M. H. Le, Integers not of the form c(2^a+2^b)+p^{alpha}, Acta Arith. 99(2001), 183-190.
Links
- Zhi-Wei Sun, Table of n, a(n) for n = 1..50000
- Zhi-Wei Sun, A project for the form p+2^x+k*2^y with k=3,5,...,61
- Zhi-Wei Sun, A promising conjecture: n=p+F_s+F_t
- D. S. McNeil, Various and sundry (a report on Sun's conjectures)
- Z.-W. Sun, Mixed sums of primes and other terms, preprint, 2009. arXiv:0901.3075
Programs
-
Mathematica
PQ[x_]:=x>2&&PrimeQ[x] RN[n_]:=Sum[If[PQ[2n-1-3*2^x-2^y],1,0], {x,1,Log[2,(2n-1)/3]},{y,1,Log[2,Max[2,2n-1-3*2^x]]}] Do[Print[n," ",RN[n]];Continue,{n,1,50000}]
Formula
: p+2^x+3*2^y = 2n-1 with p an odd prime and x,y positive integers}|.
Comments