A187757 -id:A187757 - cp's OEIS frontend

A227923 Number of ways to write n = x + y (x, y > 0) such that 6x-1 is a Sophie Germain prime and {6y-1, 6*y+1} is a twin prime pair.

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

Offset: 1

Zhi-Wei Sun, Oct 09 2013

nonn

Conjecture: (i) a(n) > 0 for all n > 1. Moreover, any integer n > 4 not equal to 13 can be written as x + y with x and y distinct and greater than one such that 6*x-1 is a Sophie Germain prime and {6*y-1, 6*y+1} is a twin prime pair.
(ii) Any integer n > 1 can be written as x + y (x, y > 0) such that 6*x-1 is a Sophie Germain prime, and {6*y+1, 6*y+5} is a cousin prime pair (or {6*y-1, 6*y+5} is a sexy prime pair).
Part (i) of the conjecture implies that there are infinitely many Sophie Germain primes, and also infinitely many twin prime pairs. For example, if all twin primes does not exceed an integer N > 2, and (N+1)!/6 = x + y with 6*x-1 a Sophie Germain prime and {6*y-1, 6*y+1} a twin prime pair, then (N+1)! = (6*x-1) + (6*y+1) with 1 < 6*y+1 < N+1, hence we get a contradiction since (N+1)! - k is composite for every k = 2..N.
We have verified that a(n) > 0 for all n = 2..10^8.
Conjecture verified up to 10^9. - Mauro Fiorentini, Jul 07 2023

			a(5) = 2 since 5 = 2 + 3 = 4 + 1, and 6*2-1 = 11 and 6*4-1 = 23 are Sophie Germain primes, and {6*3-1, 6*3+1} = {17, 19} and {6*1-1, 6*1+1} = {5,7} are twin prime pairs.
a(28) = 1 since 28 = 5 + 23 with 6*5-1 = 29 a Sophie Germain prime and {6*23-1, 6*23+1} = {137, 139} a twin prime pair.

Zhi-Wei Sun, Table of n, a(n) for n = 1..10000
Zhi-Wei Sun, Conjectures involving primes and quadratic forms, preprint, arXiv:1211.1588 [math.NT], 2012-2017.

Cf. A001359, A006512, A005384, A046132, A176130, A187757, A199920, A227920, A230037, A230040.

SQ[n_]:=PrimeQ[6n-1]&&PrimeQ[12n-1]
TQ[n_]:=PrimeQ[6n-1]&&PrimeQ[6n+1]
a[n_]:=Sum[If[SQ[i]&&TQ[n-i],1,0],{i,1,n-1}]
Table[a[n],{n,1,100}]

A230230 Number of ways to write 2n = p + q with p, q, 3p - 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

Zhi-Wei Sun, Oct 12 2013

nonn

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

			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.

Zhi-Wei Sun, Table of n, a(n) for n = 1..10000
Zhi-Wei Sun, Conjectures involving primes and quadratic forms, preprint, arXiv:1211.1588 [math.NT], 2012-2017.

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

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

A187759 Number of ways to write n=x+y (0

Original entry on oeis.org

0, 0, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 2, 0, 2, 1, 3, 2, 1, 2, 1, 2, 2, 2, 2, 3, 1, 3, 1, 2, 3, 2, 6, 1, 3, 1, 2, 4, 3, 4, 4, 1, 3, 1, 3, 5, 2, 6, 1, 3, 2, 2, 5, 2, 5, 2, 3, 1, 2, 3, 5, 2, 4, 0, 0, 3, 1, 6, 2, 3, 3, 1, 5, 1, 5, 3, 3, 3, 1, 4, 2, 3, 3, 0, 3, 3, 3, 4, 1, 3, 1, 2, 3, 2, 4, 2, 2, 3

Offset: 1

Zhi-Wei Sun, Jan 03 2013

nonn

Conjecture: If n>200 is not among 211, 226, 541, 701, then a(n)>0.
This essentially follows from the conjecture related to A219157, since n=x+y for some positive integers x and y with 6x-1,6x+1,6y-1,6y+1 all prime if and only if 6n=p+q for some twin prime pairs {p,p-2} and {q,q+2}.
Similarly, the conjecture related to A218867 implies that any integer n>491 can be written as x+y (0A219055 implies that any integer n>1600 not among 2729 and 4006 can be written as x+y (0

			a(9)=1 since 9=2+7 with 6*2-1, 6*2+1, 6*7-1 and 6*7+1 all prime.

Zhi-Wei Sun, Table of n, a(n) for n = 1..20000
Zhi-Wei Sun, Conjectures involving primes and quadratic forms, arXiv:1211.1588.

Cf. A001359, A006512, A219157, A219185, A199920, A187757, A187758, A218867, A219055.

a[n_]:=a[n]=Sum[If[PrimeQ[6k-1]==True&&PrimeQ[6k+1]==True&&PrimeQ[6(n-k)-1]==True&&PrimeQ[6(n-k)+1]==True,1,0],{k,1,(n-1)/2}]
Do[Print[n," ",a[n]],{n,1,100}]

a(n)=sum(x=1,(n-1)\2,isprime(6*x-1)&&isprime(6*x+1)&&isprime(6*n-6*x-1)&&isprime(6*n-6*x+1)) \\ Charles R Greathouse IV, Feb 28 2013

A187758 Number of ways to write n=x+y (x,y>0) with 2x-3, 2x+3, 6y+1 and 6y+5 all prime.

Original entry on oeis.org

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

Offset: 1

Zhi-Wei Sun, Jan 03 2013

nonn

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

This has been verified for n up to 10^8. It implies that there are infinitely many cousin primes and also infinitely many sexy primes.

			a(5)=1 since 5=4+1 with 2*4-3, 2*4+3, 6*1+1 and 6*1+5 all prime.

Zhi-Wei Sun, Table of n, a(n) for n = 1..20000
Zhi-Wei Sun, Conjectures involving primes and quadratic forms, arXiv:1211.1588.

Cf. A023200, A046132, A023201, A002375, A187757, A199920, A219055, A218867, A220455.

a[n_]:=a[n]=Sum[If[PrimeQ[2k-3]==True&&PrimeQ[2k+3]==True&&PrimeQ[6(n-k)+1]==True&&PrimeQ[6(n-k)+5]==True,1,0],{k,1,n-1}]
Do[Print[n," ",a[n]],{n,1,100}]

A187785 Number of ways to write n=x+y (x,y>=0) with {6x-1,6x+1} a twin prime pair and y a triangular number.

Original entry on oeis.org

1, 2, 2, 2, 2, 2, 2, 3, 1, 2, 3, 2, 4, 0, 2, 2, 3, 4, 1, 3, 1, 3, 3, 3, 2, 3, 2, 3, 2, 2, 4, 2, 7, 1, 3, 2, 1, 6, 4, 4, 3, 1, 3, 2, 3, 6, 3, 6, 0, 3, 3, 2, 6, 2, 4, 1, 3, 4, 3, 3, 4, 4, 1, 1, 1, 3, 3, 6, 2, 2, 2, 2, 7, 1, 3, 3, 2, 5, 2, 5, 2, 1, 5, 1, 4, 1, 4, 4, 1, 3, 2, 3, 4, 2, 3, 4, 2, 5, 1, 3

Offset: 1

Zhi-Wei Sun, Jan 06 2013

nonn

Conjecture: a(n)>0 for all n>48624 not equal to 76106.
We have verified this for n up to 2*10^8. It seems that 723662 is the unique n>76106 which really needs y=0 in the described representation.
Compare the conjecture with another Sun's conjecture associated with A132399.

			a(9)=1 since 9=3+3(3+1)/2 with 6*3-1 and 6*3+1 both prime.

Zhi-Wei Sun, On sums of primes and triangular numbers, J. Comb. Number Theory 1(2009), no. 1, 65-76.

Zhi-Wei Sun, Table of n, a(n) for n = 1..100000
Zhi-Wei Sun, On sums of primes and triangular numbers, J. Comb. Number Theory 1(2009), 65-76.
Zhi-Wei Sun, Conjectures involving primes and quadratic forms, arXiv:1211.1588 [math.NT], 2012-2017.

Cf. A001097, A000217, A132399, A187759, A187757, A219157.

a[n_]:=a[n]=Sum[If[PrimeQ[6(n-k(k+1)/2)-1]==True&&PrimeQ[6(n-k(k+1)/2)+1]==True,1,0],{k,0,(Sqrt[8n+1]-1)/2}]
Do[Print[n," ",a[n]],{n,1,100}]

Showing 1-5 of 5 results.

cp's OEIS Frontend

A227923 Number of ways to write n = x + y (x, y > 0) such that 6*x-1 is a Sophie Germain prime and {6*y-1, 6*y+1} is a twin prime pair.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A187759 Number of ways to write n=x+y (0

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A187758 Number of ways to write n=x+y (x,y>0) with 2x-3, 2x+3, 6y+1 and 6y+5 all prime.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A187785 Number of ways to write n=x+y (x,y>=0) with {6x-1,6x+1} a twin prime pair and y a triangular number.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

A227923 Number of ways to write n = x + y (x, y > 0) such that 6x-1 is a Sophie Germain prime and {6y-1, 6*y+1} is a twin prime pair.

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