cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-10 of 14 results. Next

A154536 Positive integers that can be written as the sum of a positive Pell number and twice a positive Pell number.

Original entry on oeis.org

3, 4, 5, 6, 7, 9, 11, 12, 14, 15, 16, 22, 25, 26, 29, 31, 33, 36, 39, 53, 59, 60, 63, 70, 72, 74, 80, 87, 94, 128, 141, 142, 145, 152, 169, 171, 173, 179, 193, 210, 227, 309, 339, 340, 343, 350, 367, 408, 410, 412
Offset: 1

Views

Author

Zhi-Wei Sun, Jan 11 2009

Keywords

Comments

On Jan 10 2009, Zhi-Wei Sun conjectured that any integer greater than 5 can be expressed as the sum of an odd prime and a term in the above sequence; in other words, each n=6,7,... can be written in the form p+P_s+2*P_t with p an odd prime and s,t>0. This has been verified up to 5*10^13 by D. S. McNeil (from London Univ.). Motivated by this conjecture, Qing-Hu Hou (from Nankai Univ.) observed and Zhi-Wei Sun proved that each term a(n) in the above sequence can be uniquely written in the form P_s+2P_t with s,t>0. Sun noted that 2176 cannot be written as the sum of a prime and two Pell numbers; D. S. McNeil found that 393185153350 cannot be written in the form p+P_s+3P_t and 872377759846 cannot be written in the form p+P_s+4P_t, where p is a prime and s and t are nonnegative.
Zhi-Wei Sun has offered a monetary reward for settling this conjecture.

Examples

			For n=12 the a(12)=22 solution is 22 = P_4 + 2*P_3.
		

References

  • R. Crocker, On a sum of a prime and two powers of two, Pacific J. Math. 36(1971), 103-107.

Crossrefs

Programs

  • Mathematica
    P[n_]:=P[n]=2*P[n-1]+P[n-2] P[0]=0 P[1]=1 i:=0 Do[Do[If[n==2*P[x]+P[y],i=i+1;Print[i," ",n]], {x,1,Max[1,Log[2,n]]},{y,1,Log[2,n]+1}]; Continue,{n,1,100000}]

Extensions

Mentioned McNeil's verification record for the representation n = p + P_s + 2P_t and his examples for n not of the form p + P_s + 3P_t and n not of the form p + P_s + 4P_t. - Zhi-Wei Sun, Jan 17 2009
D. S. McNeil has verified the conjecture up to 5*10^13. - Zhi-Wei Sun, Jan 20 2009

A154404 Number of ways to express n as the sum of an odd prime, a positive Fibonacci number and a Catalan number.

Original entry on oeis.org

0, 0, 0, 0, 1, 2, 3, 3, 5, 5, 5, 4, 6, 5, 6, 5, 7, 6, 6, 9, 9, 8, 8, 6, 8, 10, 9, 6, 9, 7, 5, 8, 10, 8, 8, 7, 6, 9, 9, 8, 8, 7, 6, 9, 9, 13, 10, 9, 8, 12, 10, 10, 10, 9, 9, 11, 9, 11, 9, 10, 8, 11, 13, 11, 10, 12, 11, 11, 10, 10, 7, 8, 10, 14, 10, 16, 11, 9, 11, 11, 10, 12, 10, 7, 9, 16, 10, 12
Offset: 1

Views

Author

Qing-Hu Hou (hou(AT)nankai.edu.cn), Jan 09 2009, Jan 18 2009

Keywords

Comments

Motivated by Zhi-Wei Sun's conjecture that each integer n>4 can be expressed as the sum of an odd prime, an odd Fibonacci number and a positive Fibonacci number (cf. A154257), during their visit to Nanjing Univ. Qing-Hu Hou (Nankai Univ.) and Jiang Zeng (Univ. of Lyon-I) conjectured on Jan 09 2009 that a(n)>0 for every n=5,6,.... and verified this up to 5*10^8. D. S. McNeil has verified the conjecture up to 5*10^13 and Hou and Zeng have offered prizes for settling their conjecture (see Sun 2009).

Examples

			For n=7 the a(7)=3 solutions are 3+2+2, 3+3+1, 5+1+1.
		

References

  • R. Crocker, On a sum of a prime and two powers of two, Pacific J. Math. 36(1971), 103-107.
  • R. P. Stanley, Enumerative Combinatorics, Vol. II, Cambridge Univ. Press, 1999, Chapter 6.

Crossrefs

Programs

  • Maple
    Cata:=proc(n) binomial(2*n,n)/(n+1); end proc: Fibo:=proc(n) if n=1 then return(1); elif n=2 then return(2); else return(Fibo(n-1) + Fibo(n-2)); fi; end proc: for n from 1 to 10^3 do rep_num:=0; for i from 1 while Fibo(i) < n do for j from 1 while Fibo(i)+Cata(j) < n do p:=n-Fibo(i)-Cata(j); if (p>2) and isprime(p) then rep_num:=rep_num+1; fi; od; od; printf("%d %d\n", n, rep_num); od:
  • Mathematica
    a[n_] := (pp = {}; p = 2; While[ Prime[p] < n, AppendTo[pp, Prime[p++]] ]; ff = {}; f = 2; While[ Fibonacci[f] < n, AppendTo[ff, Fibonacci[f++]]]; cc = {}; c = 1; While[ CatalanNumber[c] < n, AppendTo[cc, CatalanNumber[c++]]]; Count[Outer[Plus, pp, ff, cc], n, 3]); Table[a[n], {n, 1, 88}] (* Jean-François Alcover, Nov 22 2011 *)
  • PARI
    a(n)=my(i=1,j,f,c,t,s);while((f=fibonacci(i++))Charles R Greathouse IV, Nov 22 2011

Formula

a(n) = |{: p+F_s+C_t=n with p an odd prime and s>1}|.

Extensions

More terms from Jon E. Schoenfield, Jan 17 2009
Added the new verification record and Hou and Zeng's prize for settling the conjecture. Edited by Zhi-Wei Sun, Feb 01 2009
Comment edited by Charles R Greathouse IV, Oct 28 2009

A155114 Number of ways to express n as the sum of an odd prime, a positive Fibonacci number and twice a positive Fibonacci number.

Original entry on oeis.org

0, 0, 0, 0, 0, 1, 1, 3, 2, 6, 3, 7, 3, 8, 5, 8, 6, 10, 5, 11, 6, 13, 7, 13, 7, 14, 5, 14, 7, 15, 8, 14, 4, 18, 8, 17, 7, 15, 5, 15, 11, 16, 8, 15, 7, 17, 12, 19, 10, 20, 10, 17, 10, 17, 13, 15, 11, 18, 8, 20, 10, 17, 9, 18, 11, 21, 11, 21, 7, 20, 11, 18, 11, 22, 9, 25, 11, 24, 13, 19, 14, 20, 11
Offset: 1

Views

Author

Zhi-Wei Sun, Jan 20 2009

Keywords

Comments

Motivated by his conjecture related to A154257, on Dec 26 2008, Zhi-Wei Sun conjectured that a(n)>0 for n=6,7,... On Jan 15 2009, D. S. McNeil verified this up to 10^12 and found no counterexamples. See the sequence A154536 for another conjecture of this sort. Sun also conjectured that any integer n>7 can be written as the sum of an odd prime, twice a positive Fibonacci number and the square of a positive Fibonacci number; this has been verified up to 2*10^8.

Examples

			For n=10 the a(10)=6 solutions are 3 + F_4 + 2F_3, 3 + F_5 + 2F_2, 3 + F_2 + 2F_4, 5 + F_2 + 2F_3, 5 + F_4 + 2F_2, 7 + F_2 + 2F_2.
		

References

  • R. Crocker, On a sum of a prime and two powers of two, Pacific J. Math. 36(1971), 103-107.

Crossrefs

Programs

  • Mathematica
    PQ[m_]:=m>2&&PrimeQ[m] RN[n_]:=Sum[If[PQ[n-2*Fibonacci[x]-Fibonacci[y]],1,0], {x,2,2*Log[2,Max[2,n/2]]},{y,2,2*Log[2,Max[2,n-2*Fibonacci[x]]]}] Do[Print[n," ",RN[n]];Continue,{n,1,100000}]

Formula

a(n) = |{: p+F_s+2F_t=n with p an odd prime and s,t>1}|.

A154290 Number of ordered triples satisfying p+F_s+L_t = n, where p is an odd prime, s >= 2 and F_s or L_t is odd.

Original entry on oeis.org

0, 0, 0, 0, 1, 2, 3, 5, 5, 7, 6, 8, 6, 8, 8, 10, 9, 9, 11, 11, 10, 14, 10, 11, 11, 15, 13, 14, 10, 10, 11, 12, 12, 14, 15, 14, 13, 14, 12, 13, 11, 16, 13, 15, 15, 16, 13, 17, 12, 17
Offset: 1

Views

Author

Zhi-Wei Sun, Jan 06 2009, Jan 07 2008

Keywords

Comments

Zhi-Wei Sun conjectured that a(n)>0 for every n=5,6,...; in other words, any integer n>4 can be written as the sum of an odd prime, a positive Fibonacci number and a Lucas number, with the Fibonacci number or the Lucas number odd. Moreover, Sun conjectured that lim inf_n a(n)/log(n) is greater than 3 and smaller than 4.

Examples

			For n=10 the a(10)=7 solutions are 3+F_4+L_3, 3+F_5+L_0, 5+F_2+L_3, 5+F_3+L_2, 5+F_4+L_0, 7+F_2+L_0, 7+F_3+L_1.
		

References

  • R. Crocker, On a sum of a prime and two powers of two, Pacific J. Math. 36(1971), 103-107.

Crossrefs

Programs

  • Mathematica
    PQ[m_]:=m>2&&PrimeQ[m] RN[n_]:=Sum[If[(Mod[n,2]==0||Mod[x,3]>0)&&PQ[n-(2*Fibonacci[x+1]-Fibonacci[x])-Fibonacci[y]],1,0], {x,0,2*Log[2,n]},{y,2,2*Log[2,Max[2,n-(2*Fibonacci[x+1]-Fibonacci[x])]]}] Do[Print[n," ",RN[n]];Continue,{n,1,50000}]

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.

Original entry on oeis.org

0, 0, 0, 0, 0, 1, 2, 2, 3, 4, 5, 3, 5, 7, 4, 7, 9, 5, 6, 9, 5, 7, 11, 6, 6, 12, 5, 9, 13, 8, 10, 12, 4, 11, 15, 6, 10, 15, 5, 9, 16, 9, 9, 17, 8, 8, 17, 8, 10, 16, 8, 11, 13, 10, 10, 20, 7, 12, 23, 10, 10, 21, 9, 11, 18, 11, 8, 18, 9, 11, 20, 9, 13, 17, 9, 12, 19, 9, 13, 22, 6, 13, 21, 10, 10, 21
Offset: 1

Views

Author

Zhi-Wei Sun, Jan 29 2009

Keywords

Comments

On Jan 21 2009, Zhi-Wei Sun conjectured that a(n)>0 for n=6,7,...; in other words, any odd integer m>10 can be written as the sum of an odd prime, a positive power of 2 and three times a positive power of 2. Sun verified this for odd integers m<10^7. On Sun's request, Qing-Hu Hou and Charles R Greathouse IV continued the verification for odd integers below 2*10^8 and 10^10 respectively and found no counterexamples.
As 3*2^y = 2^y + 2^{y+1}, Sun's conjecture implies that each odd integer m>8 can be written as the sum of an odd prime and three positive powers of two. Note that Paul Erdős asked whether there is a positive integer r such that every odd integer m>3 can be written as the sum of a prime and at most r powers of 2.
Zhi-Wei Sun also raised the following problem: For k=3,5,...,61 determine whether any odd integer m>2k+3 can be written in the form p + 2^x + k*2^y with p an odd prime and x,y positive integers. Sun observed that 353 is not of the form p + 2^x + 51*2^y and Qing-Hu Hou continued the search for m<2.5*10^7 and found that 22537515 is not of the form p + 2^x + 47*2^y. For k=3,5,...,45,49,53,55,...,61, Sun has checked odd integers below 10^8 and found no odd integer m>2k-3 not of the form p + 2^x + k*2^y.

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.

Crossrefs

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

a(n) = |{: p+2^x+3*2^y = 2n-1 with p an odd prime and x,y positive integers}|.

A154940 Number of ways to express n as the sum of an odd prime, a Lucas number and a Catalan number.

Original entry on oeis.org

0, 0, 0, 0, 1, 2, 3, 4, 5, 5, 6, 5, 5, 5, 7, 7, 6, 5, 9, 8, 8, 9, 10, 7, 9, 10, 7, 9, 7, 6, 7, 9, 7, 9, 11, 9, 9, 8, 8, 7, 7, 7, 8, 8, 9, 11, 10, 10, 13, 12, 10, 10, 10, 10, 10, 14, 9, 7, 11, 11, 9, 14, 12, 10, 12, 13, 9, 11, 8, 7, 10, 12, 10, 12, 12, 12, 12, 11, 11, 12, 8, 11, 11, 14, 10, 13, 10
Offset: 1

Views

Author

Zhi-Wei Sun, Jan 17 2009

Keywords

Comments

On Jan 16 2009, Zhi-Wei Sun conjectured that a(n)>0 for n=5,6,... and verified this up to 5*10^6. (Sun also thought that lim inf_n a(n)/log(n) is a positive constant.) D. S. McNeil continued the verification up to 10^13 and found no counterexamples. The conjecture is similar to a conjecture of Qing-Hu Hou and Jiang Zeng related to the sequence A154404; both conjectures were motivated by Sun's recent conjecture on sums of primes and Fibonacci numbers (cf. A154257).

Examples

			For n=10 the a(10)=5 solutions are 3 + L_0 + C_3, 5 + L_2 + C_2, 5 + L_3 + C_1, 7 + L_0 + C_1, 7 + L_1 + C_2.
		

References

  • R. Crocker, On a sum of a prime and two powers of two, Pacific J. Math. 36(1971), 103-107.
  • R. P. Stanley, Enumerative Combinatorics, Vol. II, Cambridge Univ. Press, 1999, Chapter 6.

Crossrefs

Programs

  • Mathematica
    PQ[m_]:=m>2&&PrimeQ[m] L[x_]:=2*Fibonacci[x+1]-Fibonacci[x] RN[n_]:=Sum[If[PQ[n-L[x]-CatalanNumber[y]], 1, 0], {x,0,2*Log[2,n]},{y,1,2*Log[2,Max[2,n-L[x]+1]]}] Do[Print[n, " ",RN[n]]; Continue, {n, 1, 100000}]

Formula

a(n) = |{: p+L_s+C_t=n with p an odd prime, s>=0 and t>0}|.

Extensions

More terms (from b-file) added by N. J. A. Sloane, Aug 31 2009

A155904 Number of ways to write 2n-1 as p+2^x+5*2^y with p an odd prime and x,y positive integers.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 1, 2, 2, 2, 2, 4, 3, 5, 6, 4, 5, 4, 4, 6, 5, 6, 7, 7, 5, 7, 11, 5, 10, 8, 5, 10, 7, 5, 8, 8, 7, 6, 10, 6, 8, 13, 9, 12, 10, 8, 14, 10, 7, 13, 12, 7, 10, 10, 9, 10, 17, 8, 11, 11, 9, 16, 12, 7, 13, 8, 10, 7, 8, 10, 11, 14, 5, 14, 14, 10, 17, 12, 7, 11, 12, 10, 12, 10, 12, 13, 17
Offset: 1

Views

Author

Zhi-Wei Sun, Jan 30 2009

Keywords

Comments

On Jan 21 2009, Zhi-Wei Sun conjectured that a(n)>0 for n=8,9,...; in other words, any odd integer m>=15 can be written as the sum of an odd prime, a positive power of 2 and five times a positive power of 2. Sun has verified this for odd integers m<10^8. As 5*2^y=2^y+2^{y+2}, the conjecture implies that each odd integer m>8 can be written as the sum of an odd prime and three positive powers of two. [It is known that there are infinitely many positive odd integers not of the form p+2^x+2^y (R. Crocker, 1971).] Sun also conjectured that there are infinitely many positive integers n with a(n)=a(n+1); here is the list of such positive integers n: 1, 2, 3, 4, 5, 6, 9, 10, 11, 19, 24, 36, 54, 60, 75, 90, 98, 101, 105, 135, 153, 173, ...

Examples

			For n=15 the a(15)=5 solutions are 29 = 17 + 2 + 5*2 = 11 + 2^3 + 5*2 = 3 + 2^4 + 5*2 = 7 + 2 + 5*2^2 = 5 + 2^2 + 5*2^2.
		

References

  • R. Crocker, On a sum of a prime and two powers of two, Pacific J. Math. 36(1971), 103-107.

Crossrefs

Programs

  • Mathematica
    PQ[x_]:=x>2&&PrimeQ[x] RN[n_]:=Sum[If[PQ[2n-1-5*2^x-2^y],1,0], {x,1,Log[2,(2n-1)/5]},{y,1,Log[2,2n-1-5*2^x]}] Do[Print[n," ",RN[n]];Continue,{n,1,50000}]

Formula

a(n) = |{: p+2^x+5*2^y=2n-1 with p an odd prime and x,y positive integers}|.

A154364 Number of ways to express n as the sum of an odd prime, a positive Pell number and a companion Pell number.

Original entry on oeis.org

0, 0, 0, 0, 0, 1, 1, 1, 1, 3, 2, 2, 1, 4, 2, 2, 2, 4, 3, 4, 5, 4, 3, 4, 3, 5, 4, 2, 3, 4, 4, 3, 4, 4, 3, 4, 4, 7, 4, 4, 3, 6, 3, 6, 5, 6, 4, 8, 5, 7, 4, 5, 3, 7, 5, 5, 5, 5, 4, 5, 3, 6, 4, 4, 4, 7, 4, 6, 4, 4, 2, 6, 3, 7, 6, 6, 6, 7, 6, 6, 3, 7, 6, 3, 4, 9, 9
Offset: 1

Views

Author

Zhi-Wei Sun, Jan 07 2009

Keywords

Comments

This is inspired by the sequence A154290 and related conjectures of Sun. On Jan 08 2009, Zhi-Wei Sun and Qing-Hu Hou conjectured that a(n)>0 for n=6,7,...; in other words, any integer n>5 can be written as the sum of an odd prime, a positive Pell number and a companian Pell number. The Pell numbers are defined by P_0=0, P_1=1 and P_{n+1}=2P_n+P_{n-1} (n=1,2,3,...) and the companion Pell numbers are given by Q_0=Q_1=2 and Q_{n+1}=2Q_n+Q_{n-1} (n=1,2,3...). Note that for n>5 both P_n and Q_n are greater than 2^n.
D. S. McNeil disproved the conjecture by finding the 4 initial counterexamples: 169421772576, 189661491306, 257744272674, 534268276332. - Zhi-Wei Sun, Jan 17 2009
On Feb 01 2009, Zhi-Wei Sun observed that these 4 counterexamples are divisible by 42 and guessed that all counterexamples to the conjecture of Sun and Hou should be multiples of 42. - Zhi-Wei Sun, Feb 01 2009

Examples

			For n=10 the a(10)=3 solutions are 3+5+2, 3+1+6, 7+1+2.
		

Crossrefs

Programs

  • Maple
    Pell:=proc(n) if n=0 then return(0); elif n=1 then return(1); else return( 2*Pell(n-1) + Pell(n-2) ); fi; end proc: comp_Pell:=proc(n) if n=0 then return(2); elif n=1 then return(2); else return( 2*comp_Pell(n-1) + comp_Pell(n-2) ); fi; end proc: for n from 1 to 10^5 do rep_num:=0; for i from 1 while Pell(i)2) and isprime(p) then rep_num:=rep_num+1; fi; od; od; printf("%d %d\n", n, rep_num); od:
  • Mathematica
    nmax = 10^3;
    Pell[n_] := Pell[n] = If[n == 0, Return[0], If[n == 1, Return[1], Return[2* Pell[n - 1] + Pell[n - 2]]]];
    compPell[n_] := compPell[n] = If[n == 0, Return[2], If[n == 1, Return[2],  Return[2*compPell[n - 1] + compPell[n - 2]]]];
    Reap[For[n = 1, n <= nmax, n++, repnum = 0; For[i = 1, Pell[i] < n, i++, For[j = 1, Pell[i] + compPell[j] < n, j++, p = n - Pell[i] - compPell[j]; If[p > 2 && PrimeQ[p], repnum++]]]; Sow[repnum]]][[2, 1]] (* Jean-François Alcover, Dec 13 2017, translated from Maple *)

A157218 Number of ways to write the n-th positive odd integer in the form p+2^x+7*2^y with p a prime congruent to 1 mod 6 and x,y positive integers.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 2, 1, 0, 2, 3, 1, 1, 3, 1, 1, 4, 2, 3, 2, 1, 3, 3, 2, 3, 5, 1, 2, 5, 2, 4, 5, 1, 4, 3, 1, 4, 7, 1, 5, 7, 2
Offset: 1

Views

Author

Zhi-Wei Sun, Feb 25 2009

Keywords

Comments

On Feb 24 2009, Zhi-Wei Sun conjectured that a(n)>0 for all n=18,19,...; in other words, any odd integer greater than 34 can be written as the sum of a prime congruent to 1 mod 6, a positive power of 2 and seven times a positive power of 2. Sun verified the conjecture for odd integers below 5*10^7, and Qing-Hu Hou continued the verification for odd integers below 1.5*10^8 (on Sun's request). Compare the conjecture with R. Crocker's result that there are infinitely many positive odd integers not of the form p + 2^x + 2^y with p an odd prime and x,y positive integers.

Examples

			For n=19 the a(19)=3 solutions are 2*19 - 1 = 7 + 2 + 7*2^2 = 7 + 2^4 + 7*2 = 19 + 2^2 + 7*2.
		

References

  • R. Crocker, On a sum of a prime and two powers of two, Pacific J. Math. 36(1971), 103-107.

Crossrefs

Programs

  • Mathematica
    PQ[x_]:=x>1&&Mod[x,6]==1&&PrimeQ[x] RN[n_]:=Sum[If[PQ[2n-1-7*2^x-2^y],1,0], {x,1,Log[2,(2n-1)/7]},{y,1,Log[2,Max[2,2n-1-7*2^x]]}] Do[Print[n," ",RN[n]],{n,1,200000}]

Formula

a(n) = |{: p+2^x+7*2^y=2n-1 with p a prime congruent to 1 mod 6 and x,y positive integers}|.

A157237 Number of ways to write the n-th positive odd integer in the form p+2^x+11*2^y with p a prime congruent to 1 mod 6 and x,y positive integers.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 2, 1, 0, 2, 2, 0, 1, 1, 1, 2, 2, 2, 4, 1, 2, 5, 2, 1, 3, 1, 1, 2, 1, 3, 3, 1, 3, 5, 2, 2, 5, 4, 0, 5, 4, 2, 4, 3, 3, 4, 3, 3
Offset: 1

Views

Author

Zhi-Wei Sun, Feb 25 2009

Keywords

Comments

On Feb. 24, 2009, Zhi-Wei Sun conjectured that a(n)=0 if and only if n<16 or n=18, 21, 24, 51, 84, 1011, 59586; in other words, except for 35, 41, 47, 101, 167, 2021, 119171, any odd integer greater than 30 can be written as the sum of a prime congruent to 1 mod 6, a positive power of 2 and eleven times a positive power of 2. Sun verified the conjecture for odd integers below 5*10^7, and Qing-Hu Hou continued the verification for odd integers below 1.5*10^8 (on Sun's request). Compare the conjecture with Crocker's result that there are infinitely many positive odd integers not of the form p+2^x+2^y with p an odd prime and x,y positive integers.

Examples

			For n=19 the a(19)=2 solutions are 2*19-1=7+2^3+2*11=13+2+2*11.
		

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.

Crossrefs

Programs

  • Mathematica
    PQ[x_]:=x>1&&Mod[x,6]==1&&PrimeQ[x] RN[n_]:=Sum[If[PQ[2n-1-11*2^x-2^y],1,0], {x,1,Log[2,(2n-1)/11]},{y,1,Log[2,Max[2,2n-1-11*2^x]]}] Do[Print[n," ",RN[n]],{n,1,200000}]

Formula

a(n)=|{: p+2^x+11*2^y=2n-1 with p a prime congruent to 1 mod 6 and x,y positive integers}|
Showing 1-10 of 14 results. Next