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-7 of 7 results.

A154952 Index of first occurrence of n in A154404.

Original entry on oeis.org

1, 5, 6, 7, 12, 9, 13, 17, 22, 20, 26, 56, 50, 46, 74, 106, 76, 152, 116, 242, 206, 284, 623, 1056, 1032, 1582, 1586, 1616, 1892, 1676, 4286, 5484, 4946, 7016, 5366, 11262, 18776, 17486, 19688, 18192, 21018, 60662, 51476, 56546, 79946, 66986, 105476
Offset: 0

Views

Author

Jon E. Schoenfield, Jan 18 2009

Keywords

Comments

A related problem is to determine the index of the last occurrence of n in A154404. Among the first 10^6 terms in A154404, the values 0, 1, 2 and 3 last occur at indices 4, 5, 6 and 8, respectively, but all values larger than 3 that occur at all (4 through 56 and 58 through 61) do so at least once beyond the 500000th term.
The value 4, after its initial occurrence in A154404 at n=12, does not reoccur until n=666393. (The 4 ways to reach 666393 as a sum of an odd prime, a positive Fibonacci number and a Catalan number are 605023+2584+58786, 606997+610+58786, 607573+34+58786 and 648677+17711+5.)

Examples

			a(4) = 12 because 12 is the smallest number that can be expressed in exactly 4 ways as the sum of an odd prime, a positive Fibonacci number and a Catalan number. (The 4 ways are 3+8+1, 5+2+5, 5+5+2 and 7+3+2.)
		

Crossrefs

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}|.

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}|.

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}|.

A157225 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 5 mod 6 and x,y positive integers.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 2, 1, 0, 2, 3, 1, 2, 4, 1, 2, 4, 2, 2, 3, 2, 2, 4, 2, 4, 4, 1, 5, 5, 2, 5, 7, 1, 3, 7, 2, 4, 8, 2, 4, 3, 2, 4
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<11 or n=13,16,992; in other words, except for 25, 31, 1983, any odd integer greater than 20 can be written as the sum of a prime congruent to 5 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 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=18 the a(18)=3 solutions are 2*18-1=5+2+7*2^2=5+2^4+7*2=17+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.
  • 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]==5&&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 5 mod 6 and x,y positive integers}|
Showing 1-7 of 7 results.