A236470 -id:A236470 - cp's OEIS frontend

A236458 Primes p with p + 2 and prime(p) + 2 both prime.

3, 5, 17, 41, 1949, 2309, 2711, 2789, 2801, 3299, 3329, 3359, 3917, 4157, 4217, 4259, 4637, 5009, 5021, 5231, 6449, 7757, 8087, 8219, 8627, 9419, 9929, 10007, 10937, 11777, 12071, 14321, 15647, 15971, 16061, 16901, 18131, 18251, 18287, 18539

Offset: 1

Zhi-Wei Sun, Jan 26 2014

nonn

According to the conjecture in A236470, the sequence should have infinitely many terms. This is stronger than the twin prime conjecture.

See A236457 and A236467 for similar sequences.

			a(1) = 3 since 3 + 2 = 5 and prime(3) + 2 = 7 are both prime, but 2 + 2 = 4 is composite.

Zhi-Wei Sun, Table of n, a(n) for n = 1..10000

Cf. A000040, A001359, A006512, A236119, A236456, A236457, A236467, A236470.

p[n_]:=PrimeQ[n+2]&&PrimeQ[Prime[n]+2]
n=0;Do[If[p[Prime[m]],n=n+1;Print[n," ",Prime[m]]],{m,1,10000}]

s=[]; forprime(p=2, 20000, if(isprime(p+2) && isprime(prime(p)+2), s=concat(s, p))); s \\ Colin Barker, Jan 26 2014

A236481 Primes p with p + 2, prime(p) + 2 and prime(prime(p)) + 2 all prime.

Original entry on oeis.org

3, 1949, 4217, 8219, 9929, 22091, 23537, 28097, 38711, 41609, 50051, 60899, 68111, 72227, 74159, 79631, 115151, 122399, 127679, 150959, 155537, 266687, 267611, 270551, 271499, 284741, 306347, 428297, 433661, 444287

Offset: 1

Zhi-Wei Sun, Jan 26 2014

nonn

Conjecture: For any positive integer m, there are infinitely many chains p(1) < p(2) < ... < p(m) of m primes with p(k) + 2 prime for all k = 1,...,m such that p(k + 1) = prime(p(k)) for every 0 < k < m.

			a(1) = 3 since 3, 3 + 2 = 5, prime(3) + 2 = 7 and prime(prime(3)) + 2 = prime(5) + 2 = 13 are all prime, but 2 + 2 = 4 is composite.

Zhi-Wei Sun, Table of n, a(n) for n = 1..5000
Zhi-Wei Sun, A new kind of prime chains, a message to Number Theory List, Jan. 20, 2014.

Cf. A000010, A000040, A001359, A006512, A235925, A236066, A236457, A236458, A236468, A236470, A236480, A236482, A236484.

p[n_]:=p[n]=PrimeQ[n+2]&&PrimeQ[Prime[n]+2]&&PrimeQ[Prime[Prime[n]]+2]
n=0;Do[If[p[Prime[m]],n=n+1;Print[n," ",Prime[m]]],{m,1,10^6}]

A236472 a(n) = |{0 < k < n: p = prime(k) + phi(n-k), prime(p) + 2 and prime(p) + 6 are all prime}|, where phi(.) is Euler's totient function.

Original entry on oeis.org

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

Offset: 1

Zhi-Wei Sun, Jan 26 2014

nonn

Conjecture: a(n) > 0 for every n = 330, 331, ....
We have verified this for n up to 80000.
The conjecture implies that there are infinitely many prime triples of the form {prime(p), prime(p) + 2, prime(p) + 6} with p prime. See A236464 for such primes p.

			a(10) = 1 since prime(2) + phi(8) = 3 + 4 = 7, prime(7) + 2 = 17 + 2 = 19 and prime(7) + 6 = 23 are all prime.
a(877) = 1 since prime(784) + phi(877-784) = 6007 + 60 = 6067, prime(6067) + 2 = 60101 + 2 = 60103 and prime(6067) + 6 = 60107 are all prime.

Zhi-Wei Sun, Table of n, a(n) for n = 1..10000

Cf. A000010, A000040, A022004, A236456, A236460, A236464, A236467, A236470.

p[n_]:=PrimeQ[n]&&PrimeQ[Prime[n]+2]&&PrimeQ[Prime[n]+6]
f[n_,k_]:=Prime[k]+EulerPhi[n-k]
a[n_]:=Sum[If[p[f[n,k]],1,0],{k,1,n-1}]
Table[a[n],{n,1,100}]

A236480 a(n) = |{0 < k < n-2: p = 2*phi(k) + phi(n-k)/2 + 1, prime(p) + 2 and prime(prime(p)) + 2 are all prime}|, where phi(.) is Euler's totient function.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 2, 1, 1, 2, 1, 3, 2, 2, 0, 2, 3, 1, 2, 1, 3, 3, 2, 2, 1, 1, 1, 3, 0, 2, 3, 2, 1, 3, 0, 2, 0, 1, 1, 1, 1, 2, 0, 0, 0, 0, 2, 2, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0

Offset: 1

Zhi-Wei Sun, Jan 26 2014

nonn

Conjecture: a(n) > 0 for every n = 640, 641, ....
We have verified this for n up to 75000.
The conjecture implies that there are infinitely many primes p with prime(p) + 2 and prime(prime(p)) + 2 both prime.

			a(8) = 1 since 2*phi(3) + phi(5)/2 + 1 = 7, prime(7) + 2 = 17 + 2 = 19 and prime(prime(7)) + 2 = prime(17) + 2 = 61 are all prime.
a(667) = 1 since 2*phi(193) + phi(667-193)/2 + 1 = 384 + 78 + 1 = 463, prime(463) + 2 = 3299 + 2 = 3301 and prime(prime(463)) + 2 = prime(3299) + 2 = 30559 are all prime.

Zhi-Wei Sun, Table of n, a(n) for n = 1..10000

Cf. A000010, A000040, A001359, A006512, A236456, A236457, A236458, A236468, A236470, A236481.

p[n_]:=PrimeQ[n]&&PrimeQ[Prime[n]+2]&&PrimeQ[Prime[Prime[n]]+2]
f[n_,k_]:=2*EulerPhi[k]+EulerPhi[n-k]/2+1
a[n_]:=Sum[If[p[f[n,k]],1,0],{k,1,n-3}]
Table[a[n],{n,1,100}]

A259488 Positive integers k with prime(k)+2 and prime(prime(k))+2 both prime.

Original entry on oeis.org

2, 3, 7, 13, 296, 343, 395, 405, 408, 463, 469, 473, 542, 572, 577, 584, 625, 671, 673, 695, 837, 984, 1016, 1030, 1074, 1165, 1224, 1230, 1328, 1410, 1445, 1679, 1825, 1860, 1867, 1949, 2078, 2091, 2095, 2123, 2167, 2476, 2478, 2616, 2753, 2764, 2956, 3011, 3065, 3416, 3621, 3646, 3712, 3720, 3758, 3872, 3926, 4063, 4071, 4079, 4133, 4217, 4312, 4351, 4524, 4745, 4855, 4865, 4882, 4922

Offset: 1

Zhi-Wei Sun, Jun 28 2015

nonn

The conjecture in A259487 essentially says that {a(m)/a(n): m,n = 1,2,3,...} coincides with the set of all positive rational numbers. This implies that the current sequence has infinitely many terms.

			a(1) = 2 since prime(2)+2 = 5 and prime(prime(2))+2 = prime(3)+2 = 7 are both prime, but prime(1)+2 = 4 is composite.
a(2) = 3 since prime(3)+2 = 7 and prime(prime(3))+2 = prime(7)+2 = 19 are 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, A001359, A006512, A236458, A236470, A259487.

n=0;Do[If[PrimeQ[Prime[k]+2]&&PrimeQ[Prime[Prime[k]]+2],n=n+1;Print[n," ",k]],{k,1,5000}]
Select[Range[5000],AllTrue[{Prime[#]+2,Prime[Prime[#]]+2},PrimeQ]&] (* The program uses the AllTrue function from Mathematica version 10 *) (* Harvey P. Dale, Feb 18 2018 *)

k=pk=0; forprime(ppk=2,1e6, if(isprime(pk++),k++; if(isprime(pk+2) && isprime(ppk+2), print1(k", ")))) \\ Charles R Greathouse IV, Jun 29 2015

cp's OEIS Frontend

A236458 Primes p with p + 2 and prime(p) + 2 both prime.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A236481 Primes p with p + 2, prime(p) + 2 and prime(prime(p)) + 2 all prime.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A236472 a(n) = |{0 < k < n: p = prime(k) + phi(n-k), prime(p) + 2 and prime(p) + 6 are all prime}|, where phi(.) is Euler's totient function.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A236480 a(n) = |{0 < k < n-2: p = 2*phi(k) + phi(n-k)/2 + 1, prime(p) + 2 and prime(prime(p)) + 2 are all prime}|, where phi(.) is Euler's totient function.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A259488 Positive integers k with prime(k)+2 and prime(prime(k))+2 both prime.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI