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

A230219 Number of ways to write 2*n + 1 = p + q + r with p <= q such that p, q, r are primes in A230217 and p + q + 9 is also prime.

Original entry on oeis.org

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

Views

Author

Zhi-Wei Sun, Oct 11 2013

Keywords

Comments

Conjecture: a(n) > 0 for all n > 6.
This implies Goldbach's weak conjecture for odd numbers and also Goldbach's conjecture for even numbers.
The conjecture also implies that there are infinitely many primes in A230217.

Examples

			a(18) = 1 since 2*18 + 1 = 7 + 13 + 17, and 7, 13, 17 are terms of A230217, and 7 + 13 + 9 = 29 is a prime.

Links

Crossrefs

Cf. A002375, A068307, A230217, A230140, A230141.

Programs

  • Mathematica
    RQ[n_]:=PrimeQ[n+6]&&PrimeQ[3n+8]
SQ[n_]:=PrimeQ[n]&&RQ[n]
a[n_]:=Sum[If[RQ[Prime[i]]&&RQ[Prime[j]]&&PrimeQ[Prime[i]+Prime[j]+9]&&SQ[2n+1-Prime[i]-Prime[j]],1,0],{i,1,PrimePi[n-1]},{j,i,PrimePi[2n-2-Prime[i]]}]
Table[a[n],{n,1,100}]

A230140 Number of ways to write n = x + y + z with 0 < x <= y <= z such that 6*x-1, 6*y-1, 6*z-1 are among those primes p (terms of A230138) with p + 2 and 2*p - 5 also prime.

Original entry on oeis.org

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

Views

Author

Zhi-Wei Sun, Oct 10 2013

Keywords

Comments

Conjecture: (i) a(n) > 0 for all n > 2, i.e., 6*n-3 with n > 2 can be expressed as a sum of three terms from A230138. Moreover, for any integer n > 12, there are three distinct positive integers x, y, z with x + y + z = n such that 6*x-1, 6*y-1, 6*z-1 are primes in A230138.
(ii) For each integer n > 12, there are three distinct positive integers x, y, z with x + y + z = n such that 6*x-1, 6*y-1, 6*z-1 are among those primes p with p + 2 and 2*p + 9 also prime.
Note that part (i) of this conjecture implies that there are infinitely many primes in A230138.
Indices k such that a(m)>a(k) for all m>k, are (2, 10, 26, 334, 439, 544, 551, 684, ...). The only sequence which has the first 5 terms within the 3 lines of data is A212067. (Certainly a coincidence.) - M. F. Hasler, Oct 10 2013

Examples

			a(10) = 1 since 10 = 2 + 3 + 5, and the three numbers 6*2-1=11, 6*3-1=17 and 6*5-1=29 are terms of A230138.

Links

Crossrefs

Cf. A068307, A230138, A230141.

Programs

  • Mathematica
    SQ[n_]:=PrimeQ[6n-1]&&PrimeQ[6n+1]&&PrimeQ[12n-7]
a[n_]:=Sum[If[SQ[i]&&SQ[j]&&SQ[n-i-j],1,0],{i,1,n/3},{j,i,(n-i)/2}]
Table[a[n],{n,1,100}]
  • PARI
    ip(x)=isprime(6*x-1) && isprime(6*x+1) && isprime(12*x-7); a(n)=sum(x=1,n\3,sum(y=x,ip(x)*(n-x)\2,ip(y) && ip(n-x-y))) \\ - M. F. Hasler, Oct 10 2013

A230138 List of those primes p with p + 2 and 2*p - 5 both prime.

Original entry on oeis.org

5, 11, 17, 29, 59, 71, 101, 137, 149, 179, 197, 227, 281, 311, 431, 599, 617, 641, 809, 821, 857, 1151, 1277, 1319, 1451, 1481, 1487, 1607, 1667, 1697, 1997, 2027, 2081, 2111, 2129, 2339, 2657, 2711, 2789, 3167, 3329, 3371, 3461, 3557, 3767, 3917, 3929, 4049, 4217, 4259
Offset: 1

Views

Author

Zhi-Wei Sun, Oct 10 2013

Keywords

Comments

Clearly, all terms are congruent to 5 modulo 6, and not congruent to 3 modulo 5. Primes in this sequence are sparser than twin primes and Sophie Germain primes.
This sequence is interesting because of the conjectures in the comments in A230140 and A230141.
Intersection of A001359 and A089253 (or A063909). - M. F. Hasler, Oct 10 2013

Examples

			a(1) = 5 since neither 2 + 2 nor 2*3 - 5 is prime, but 5 + 2 = 7 and 2*5 - 5 = 5 are both prime.

Links

Crossrefs

Cf. A001359, A006512, A005384, A230140, A230141.

Programs

  • Mathematica
    PQ[p_]:=PQ[p]=PrimeQ[p+2]&&PrimeQ[2p-5]
m=0
Do[If[PQ[Prime[n]],m=m+1;Print[m," ",Prime[n]]],{n,1,584}]
  • PARI
    is_A230138(p)=isprime(p)&&isprime(p+2)&&isprime(p*2-5) \\ For large p it might be much faster to check first whether p%6==5. - M. F. Hasler, Oct 10 2013

A230224 Number of ways to write 2*n = p + q + r + s with p <= q <= r <= s such that p, q, r, s are primes in A230223.

Original entry on oeis.org

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

Views

Author

Zhi-Wei Sun, Oct 12 2013

Keywords

Comments

Conjecture: a(n) > 0 for all n > 17.

Examples

			a(21) = 1 since 2*21 = 7 + 7 + 11 + 17, and 7, 11, 17 are primes in A230223.
a(27) = 1 since 2*27 = 7 + 11 + 17 + 19, and 7, 11, 17, 19 are primes in A230223.

Links

Crossrefs

Cf. A002375, A068307, A230223, A230140, A230141, A230219.

Programs

  • Mathematica
    RQ[n_]:=n>5&&PrimeQ[3n-4]&&PrimeQ[3n-10]&&PrimeQ[3n-14]
SQ[n_]:=PrimeQ[n]&&RQ[n]
a[n_]:=Sum[If[RQ[Prime[i]]&&RQ[Prime[j]]&&RQ[Prime[k]]&&SQ[2n-Prime[i]-Prime[j]-Prime[k]],1,0],
{i,1,PrimePi[n/2]},{j,i,PrimePi[(2n-Prime[i])/3]},{k,j,PrimePi[(2n-Prime[i]-Prime[j])/2]}]
Table[a[n],{n,1,100}]

A230230 Number of ways to write 2*n = p + q with p, q, 3*p - 10, 3*q + 10 all prime.

Original entry on oeis.org

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

Views

Author

Zhi-Wei Sun, Oct 12 2013

Keywords

Comments

Conjecture: a(n) > 0 for all n > 3.
This is stronger than Goldbach's conjecture for even numbers. If 2*n = p + q with p, q, 3*p - 10, 3*q + 10 all prime, then 6*n is the sum of the two primes 3*p - 10 and 3*q + 10.
Conjecture verified for 2*n up to 10^9. - Mauro Fiorentini, Jul 08 2023

Examples

			a(5) = 1 since 2*5 = 7 + 3 with 3*7 - 10 = 11 and 3*3 + 10 = 19 both prime.
a(16) = 1 since 2*16 = 13 + 19 with 3*13 - 10 = 29 and 3*19 + 10 = 67 both prime.

Links

Crossrefs

Cf. A002375, A187757, A199920, A227923, A230227, A230140, A230141, A230217, A230219, A230223, A230224.

Programs

  • Mathematica
    PQ[n_]:=n>3&&PrimeQ[3n-10]
SQ[n_]:=PrimeQ[n]&&PrimeQ[3n+10]
a[n_]:=Sum[If[PQ[Prime[i]]&&SQ[2n-Prime[i]],1,0],{i,1,PrimePi[2n-2]}]
Table[a[n],{n,1,100}]

A230227 Primes p with 3*p - 10 also prime.

Original entry on oeis.org

5, 7, 11, 13, 17, 19, 23, 31, 37, 41, 47, 53, 59, 61, 67, 79, 83, 89, 97, 101, 107, 109, 131, 137, 151, 157, 163, 167, 173, 191, 193, 199, 223, 229, 251, 257, 269, 277, 283, 307, 313, 317, 331, 347, 353, 367, 373, 397, 401, 409
Offset: 1

Views

Author

Zhi-Wei Sun, Oct 12 2013

Keywords

Comments

Conjecture: For any integer n > 4 not equal to 76, we have 2*n = p + q for some terms p and q from the sequence.
This is stronger than Goldbach's conjecture for even numbers.

Examples

			a(1) = 5 since 3*5 - 10 = 5 is prime.

Links

Crossrefs

Cf. A000040, A002375, A230138, A230140, A230141, A230217, A230219, A230223, A230224, A230230.

Programs

  • Mathematica
    PQ[p_]:=PQ[p]=p>3&&PrimeQ[3p-10]
m=0
Do[If[PQ[Prime[n]],m=m+1;Print[m," ",Prime[n]]],{n,1,80}]
Select[Prime[Range[100]],PrimeQ[3#-10]&] (* Harvey P. Dale, Jun 28 2015 *)

A230451 Number of ways to write n = x + y + z (x, y, z > 0) such that 2*x + 1, 2*y + 3, 2*z + 5 are all prime and x*y*z is a triangular number.

Original entry on oeis.org

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

Views

Author

Zhi-Wei Sun, Oct 19 2013

Keywords

Comments

Conjecture: (i) a(n) > 0 except for n = 1, 2, 4, 7.
(ii) Any integer n > 7 can be written as x + y + z (x, y, z > 0) such that 2*x + 1, 2*y + 1, 2*x*y + 1 are primes and x*y*z is a triangular number.
(iii) Each integer n > 4 not equal to 7 or 14 can be expressed as p + q + r (p, q, r > 0) with p and 2*q + 1 both primes, and p*q*r a triangular number.
(iv) Any integer n > 6 not among 16, 20, 60 can be written as x + y + z (x, y, z > 0) such that x*y + x*z + y*z is a triangular number.
Part (i) is stronger than Goldbach's weak conjecture which was finally proved by H. Helfgott in 2013.
See also A227877 and A230596 for some related conjectures.

Examples

			a(6) = 3 since 6 = 1 + 2 + 3 = 2 + 1 + 3 = 3 + 2 + 1, and 2*1 + 1 = 3, 2*2 + 3 = 7, 2*3 + 5 = 11, 2*2 + 1 = 5, 2*1 + 3 = 5, 2*3 + 1 = 7, 2*1 + 5 = 7 are all prime.
a(10) = 1 since 10 = 3 + 4 + 3, and 2*3 + 1 = 7, 2*4 + 3 = 11, 2*3 + 5 = 11 are all prime.

Links

Crossrefs

Cf. A000040, A000217, A068307, A132399, A227877, A229166, A230121, A230141, A230219, A230596.

Programs

  • Mathematica
    SQ[n_]:=IntegerQ[Sqrt[n]]
TQ[n_]:=SQ[8n+1]
a[n_]:=Sum[If[PrimeQ[2i+1]&&PrimeQ[2j+3]&&PrimeQ[2(n-i-j)+5]&&TQ[i*j(n-i-j)],1,0],{i,1,n-2},{j,1,n-1-i}]
Table[a[n],{n,1,100}]

A230194 Number of ways to write n = x + y + z (x, y, z > 0) such that all the 11 integers 6*x-1, 6*x+1, 6*x-5, 6*x+5, 6*y-1, 6*y-5, 6*y+5, 6*(x+y)+5, 6*z-1, 6*z-5 and 6*z+5 are prime.

Original entry on oeis.org

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

Views

Author

Zhi-Wei Sun, Oct 11 2013

Keywords

Comments

Conjecture: a(n) > 0 for all n > 5.
Let S be the set of those primes p with p-4 and p+6 also prime. Since each element of S has the form 6*k-1 with k > 0, the conjecture implies that 6*n-3 with n > 5 can be expressed as a sum of three primes in the set S. If n = x + y + z, then 6*n = (6*(x+y)+5) + (6*z-5). So a(n) > 0 implies Goldbach's conjecture for the even number 6*n.
Let T be the set of those primes p with p+4 and p-6 also prime. Clearly each element of T has the form 6*k+1 with k > 0. We conjecture that 6*n+3 with n > 5 can be expressed as a sum of three primes in the set T.

Examples

			a(30) = 2 since 30 = 2 + 14 + 14 = 18 + 4 + 8, and 6*2-1 = 11, 6*2+1 = 13, 6*2-5 = 7, 6*2+5 = 17, 6*14-1 = 83, 6*14-5 = 79, 6*14+5 = 89, 6*(2+14)+5 = 101, 6*18-1 = 107, 6*18+1 = 109, 6*18-5 = 103, 6*18+5 = 113, 6*4-1 = 23, 6*4-5 = 19, 6*4+5 = 29, 6*(18+4)+5 = 137, 6*8-1 = 47, 6*8-5 = 43 and 6*8+5 = 53 are all prime.

Links

Crossrefs

Cf. A230140, A230141.

Programs

  • Mathematica
    SQ[n_]:=PrimeQ[6n-1]&&PrimeQ[6n-5]&&PrimeQ[6n+5]
a[n_]:=Sum[If[SQ[i]&&PrimeQ[6i+1]&&SQ[j]&&PrimeQ[6(i+j)+5]&&SQ[n-i-j],1,0],{i,1,n-2},{j,1,n-1-i}]
Table[a[n],{n,1,100}]
Showing 1-8 of 8 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.