A261361 -id:A261361 - cp's OEIS frontend

A261352 Primes p such that prime(p)+2 = prime(q)*prime(r) for distinct primes q and r.

11, 23, 167, 197, 223, 317, 359, 461, 593, 619, 859, 1283, 1289, 1327, 1487, 1759, 1879, 2557, 2579, 2749, 2879, 3617, 4159, 4783, 5081, 5333, 5531, 5689, 5783, 5867, 6427, 6521, 7589, 7681, 7727, 7753, 9041, 9157, 9283, 9479, 10111, 10289, 10853, 11261, 11779, 11867, 12541, 13309, 13399, 13687

Offset: 1

Zhi-Wei Sun, Aug 15 2015

nonn

Conjecture: The sequence has infinitely many terms.
See also A261354 for a similar conjecture, and A261353 for a stronger conjecture.
Recall that a prime p is called a Chen prime if p+2 is a product of at most two primes. It is known that there are infinitely many Chen primes.

			a(1) = 11 since 11 is a prime, and prime(11)+2 = 3*11 = prime(2)*prime(5) with 2 and 5 both prime.
a(2) = 23 since 23 is a prime, and prime(23)+2 = 5*17 = prime(3)*prime(7) with 3 and 7 both prime.

Jing-run Chen, On the representation of a large even integer as the sum of a prime and a product of at most two primes, Sci. Sinica 16(1973), 157-176.
Zhi-Wei Sun, Problems on combinatorial properties of primes, in: M. Kaneko, S. Kanemitsu and J. Liu (eds.), Number Theory: Plowing and Starring through High Wave Forms, Proc. 7th China-Japan Seminar (Fukuoka, Oct. 28 - Nov. 1, 2013), Ser. Number Theory Appl., Vol. 11, World Sci., Singapore, 2015, pp. 169-187.

Zhi-Wei Sun, Table of n, a(n) for n = 1..10000
Zhi-Wei Sun, Problems on combinatorial properties of primes, arXiv:1402.6641 [math.NT], 2014.

Cf. A000040, A109611, A261282, A261353, A261354, A261361.

Dv[n_]:=Divisors[n]
PQ[n_]:=PrimeQ[n]&&PrimeQ[PrimePi[n]]
q[n_]:=Length[Dv[n]]==4&&PQ[Part[Dv[n],2]]&&PQ[Part[Dv[n],3]]
f[k_]:=Prime[Prime[k]]+2
n=0;Do[If[q[f[k]],n=n+1;Print[n," ",Prime[k]]],{k,1,1620}]

A261354 Primes p such that prime(p)^2 - 2 = prime(q) for some prime q.

Original entry on oeis.org

31, 191, 541, 809, 1153, 1301, 2221, 3037, 3847, 4049, 4159, 5441, 8243, 10177, 12277, 13681, 14783, 15619, 17903, 19463, 20897, 22697, 24517, 25163, 25847, 25849, 26633, 26647, 27329, 27407, 28051, 32653, 35059, 35747, 36341, 36527, 37369, 37811, 38609, 40949, 42737, 46679, 51061, 51607, 54443, 54679, 56113, 57637, 60887, 61493

Offset: 1

Zhi-Wei Sun, Aug 15 2015

nonn

Conjecture: The sequence has infinitely many terms. In general, for any integers a,b,c with a>0 and gcd(a,b,c)=1, if b^2-4*a*c is not a square, a+b+c is odd, and gcd(b,a+c) is not divisible by 3, then there are infinitely many prime pairs {p,q} such that a*prime(p)^2+b*prime(p)+c = prime(q).

			a(1) = 31 since 31 is a prime, and prime(31)^2-2 = 127^2-2 = 16127 = prime(1877) with 1877 prime.

Zhi-Wei Sun, Problems on combinatorial properties of primes, in: M. Kaneko, S. Kanemitsu and J. Liu (eds.), Number Theory: Plowing and Starring through High Wave Forms, Proc. 7th China-Japan Seminar (Fukuoka, Oct. 28 - Nov. 1, 2013), Ser. Number Theory Appl., Vol. 11, World Sci., Singapore, 2015, pp. 169-187.

Zhi-Wei Sun, Table of n, a(n) for n = 1..100
Zhi-Wei Sun, Problems on combinatorial properties of primes, arXiv:1402.6641 [math.NT], 2014.

Cf. A000040, A049002, A062326, A237413, A260120, A261281, A261352, A261361.

PQ[n_]:=PrimeQ[n]&&PrimeQ[PrimePi[n]]
f[k_]:=Prime[Prime[k]]^2-2
n=0;Do[If[PQ[f[k]],n=n+1;Print[n," ",Prime[k]]],{k,1,6200}]

A261362 Least positive integer k such that both k and kn belong to the set {m>0: 2prime(prime(m))+1 = prime(p) for some prime p}.

Original entry on oeis.org

2, 21531, 2, 35434, 11107, 35175, 24674, 64624, 127943, 1981, 155709, 50657, 74313, 11479, 6, 1981, 43405, 40859, 74229, 2, 154292, 51711, 29460, 29011, 42001, 28352, 2979, 85836, 6936, 186608, 3705, 14402, 25525, 96192, 6, 113433, 164, 787, 71873, 3365, 93169, 47219, 43128, 184740, 2, 78329, 13656, 6936, 139469, 26713

Offset: 1

Zhi-Wei Sun, Aug 16 2015

nonn

Conjecture: Let a,b,c be positive integers with gcd(a,b) = gcd(a,c) = gcd(b,c) = 1. If a+b+c is even and a is not equal to b, then any positive rational number r can be written as m/n with m and n in the set {k>0: a*prime(p) - b*prime(prime(k)) = c for some prime p}.

This implies the conjecture in A261361.

			a(2) = 21531 since 2*prime(prime(21531))+1 = 2*prime(243799)+1 = 2*3403703+1 = 6807407 = prime(464351) with 464351 prime, and 2*prime(prime(21531*2))+1 = 2*prime(520019)+1 = 2*7686083+1 = 15372167 = prime(993197) with 993197 prime.

Zhi-Wei Sun, Problems on combinatorial properties of primes, in: M. Kaneko, S. Kanemitsu and J. Liu (eds.), Number Theory: Plowing and Starring through High Wave Forms, Proc. 7th China-Japan Seminar (Fukuoka, Oct. 28 - Nov. 1, 2013), Ser. Number Theory Appl., Vol. 11, World Sci., Singapore, 2015, pp. 169-187.

Zhi-Wei Sun, Table of n, a(n) for n = 1..2250
Zhi-Wei Sun, Checking the conjecture for (a,b,c) = (1,2,1) and r = s/t (s,t = 1..70)
Zhi-Wei Sun, Problems on combinatorial properties of primes, arXiv:1402.6641 [math.NT], 2014.

Cf. A000040, A005384, A260886, A261353, A261354, A261361.

f[n_]:=2*Prime[Prime[n]]+1
PQ[p_]:=PrimeQ[p]&&PrimeQ[PrimePi[p]]
Do[k=0;Label[bb];k=k+1;If[PQ[f[k]]&&PQ[f[k*n]],Goto[aa],Goto[bb]];Label[aa];Print[n," ", k];Continue,{n,1,50}]

A261136 Primes p such that prime(p)-p+1 = prime(q) for some prime q.

Original entry on oeis.org

3, 7, 71, 103, 173, 211, 271, 293, 1117, 1451, 1531, 1753, 1787, 1801, 2089, 2239, 2341, 2371, 2713, 2999, 3019, 3779, 3881, 3917, 4159, 4447, 4513, 4591, 4969, 5107, 5483, 5573, 5591, 5701, 5813, 5867, 6011, 6271, 6311, 6361, 6397, 6427, 7243, 8467, 8513, 9157, 9343, 9433, 9719, 10103

Offset: 1

Zhi-Wei Sun, Aug 18 2015

nonn

The conjecture in A260753 implies that the current sequence has infinitely many terms.

			a(1) = 3 since prime(3)-3+1 = 5-3+1 = prime(2) with 3 and 2 both prime.
a(3) = 71 since prime(71)-71+1 = 353-70 = 283 = prime(61) with 71 and 61 both prime.

Zhi-Wei Sun, Problems on combinatorial properties of primes, in: M. Kaneko, S. Kanemitsu and J. Liu (eds.), Number Theory: Plowing and Starring through High Wave Forms, Proc. 7th China-Japan Seminar (Fukuoka, Oct. 28 - Nov. 1, 2013), Ser. Number Theory Appl., Vol. 11, World Sci., Singapore, 2015, pp. 169-187.

Zhi-Wei Sun, Table of n, a(n) for n = 1..10000
Zhi-Wei Sun, Problems on combinatorial properties of primes, arXiv:1402.6641 [math.NT], 2014.

Cf. A000040, A234695, A260753, A261361.

f[n_]:=Prime[Prime[n]]-Prime[n]+1
PQ[p_]:=PrimeQ[p]&&PrimeQ[PrimePi[p]]
n=0;Do[If[PQ[f[k]],n=n+1;Print[n," ",Prime[k]]],{k,1,1241}]
prQ[x_]:=Module[{c=Prime[x]-x+1},AllTrue[{c,PrimePi[c]},PrimeQ]]; Select[Prime[ Range[ 2000]],prQ] (* Harvey P. Dale, Apr 27 2023 *)

cp's OEIS Frontend

A261352 Primes p such that prime(p)+2 = prime(q)*prime(r) for distinct primes q and r.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

A261354 Primes p such that prime(p)^2 - 2 = prime(q) for some prime q.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

A261362 Least positive integer k such that both k and k*n belong to the set {m>0: 2*prime(prime(m))+1 = prime(p) for some prime p}.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

A261136 Primes p such that prime(p)-p+1 = prime(q) for some prime q.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

A261362 Least positive integer k such that both k and kn belong to the set {m>0: 2prime(prime(m))+1 = prime(p) for some prime p}.