A006512 -id:A006512 - cp's OEIS frontend

A219157 Number of prime pairs {p,q} with p>q and p-2,q+2 also prime such that p+(1+mod(-n,6))q=n if n is not congruent to 2 mod 6, and p-q=n and q

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

Offset: 1

Zhi-Wei Sun, Nov 12 2012

nonn

Conjecture: a(n)>0 for all n>30000 with n different from 38451, 46441, 50671, 62371.

This conjecture is stronger than the twin prime conjecture. It is similar to the conjecture associated with A219055 about sexy prime pairs.

			a(16)=1 since 16=7+3*3 with 7-2 and 3+2 prime. a(26)=1 since 26=31-5 with 31-2 and 5+2 prime.

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

Cf. A001359, A006512, A002375, A046927, A219055, A218754, A218825, A219052.

c[n_]:=c[n]=If[Mod[n-2,6]==0,1,-1-Mod[-n,6]]
d[n_]:=d[n]=2+If[Mod[n-2,6]>0,Mod[-n,6],0]
a[n_]:=a[n]=Sum[If[PrimeQ[Prime[k]+2]==True&&PrimeQ[n+c[n]Prime[k]]==True&&PrimeQ[n+c[n]Prime[k]-2]==True,1,0],
{k,1,PrimePi[(n-1)/d[n]]}]
Do[Print[n," ",a[n]],{n,1,100000}]

A219185 Number of prime pairs {p,q} (p>q) with 3(p-q)-1 and 3(p-q)+1 both prime such that p+(1+(n mod 2))q=n.

Original entry on oeis.org

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

Offset: 1

Zhi-Wei Sun, Nov 13 2012

nonn

Conjecture: a(n)>0 for all odd n>4676 and even n>30986.

This conjecture has been verified for n up to 5*10^7. It implies Goldbach's conjecture, Lemoine's conjecture and the twin prime conjecture.

			a(11)=1 since 11=5+2*3, and both 3(5-3)-1=5 and 3(5-3)+1=7 are prime.
a(16)=2 since 16=11+5=13+3, and 3(11-5)-1, 3(11-5)+1, 3(13-3)-1, 3(13-3)+1 are all prime.

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

Cf. A001359, A006512, A002375, A046927, A219157, A219055, A218867, A218754, A218825, A219052.

a[n_]:=a[n]=Sum[If[PrimeQ[n-(1+Mod[n,2])Prime[k]]==True&&PrimeQ[3(n-(2+Mod[n,2])Prime[k])-1]==True&&PrimeQ[3(n-(2+Mod[n,2])Prime[k])+1]==True,1,0],
{k,1,PrimePi[(n-1)/(2+Mod[n,2])]}]
Do[Print[n," ",a[n]],{n,1,100000}]

a(n)=if(n%2, aOdd(n), aEven(n))
aOdd(n)=my(s); forprime(q=2,(n-1)\3, my(p=n-2*q); if(isprime(n-2*q) && isprime(3*n-9*q-1) && isprime(3*n-9*q+1), s++)); s
aEven(n)=my(s); forprime(q=2,n/2, if(isprime(n-q) && isprime(3*n-6*q-1) && isprime(3*n-6*q+1), s++)); s
\\ Charles R Greathouse IV, Jul 31 2016

A236531 a(n) = |{0 < k < n: {6k -1 , 6k + 1} and {prime(n-k), prime(n-k) + 2} are both twin prime pairs}|.

Original entry on oeis.org

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

Offset: 1

Zhi-Wei Sun, Jan 27 2014

nonn

Conjecture: (i) a(n) > 0 for all n > 2.
(ii) If n > 3 is neither 11 nor 125, then n can be written as k + m with k > 0 and m > 0 such that 6*k - 1, 6*k + 1, prime(m) + 2 and 3*prime(m) - 10 are all prime.
(iii) Any integer n > 458 can be written as p + q  with q > 0 such that {p, p + 2} and {prime(q), prime(q) + 2} are both twin prime pairs.
This is much stronger than the twin prime conjecture. We have verified part (i) of the conjecture for n up to 2*10^7.

			a(11) = 1 since {6*1 - 1, 6*1 + 1} = {5, 7} and {prime(10), prime(10) + 2} = {29, 31} are both twin prime pairs.
a(16) = 1 since {6*3 - 1, 6*3 + 1} = {17, 19} and {prime(13), prime(13) + 2} = {41, 43} are both twin prime pairs.

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

Cf. A000040, A001359, A002822, A006512, A199920.

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

A259487 Least positive integer m with prime(m)+2 and prime(prime(m))+2 both prime such that prime(mn)+2 and prime(prime(mn))+2 are both prime.

Original entry on oeis.org

2, 1860, 408, 25011, 51312, 37977, 695, 4071, 10970, 3621, 17671, 12005, 1230, 19494, 542, 577, 408, 2476, 584, 542, 469, 34229, 343, 24078, 3011, 25749, 20706, 24198, 2478, 3926, 1030, 1030, 13857, 3621, 343, 13380, 2476, 4922, 2476, 296, 19176, 29175, 34737, 13, 625, 2956, 408, 572, 7, 469, 15604, 9699, 26515, 2167, 5302, 9773, 54254, 1410, 4524, 4351

Offset: 1

Zhi-Wei Sun, Jun 28 2015

nonn

Conjecture: Any positive rational number r can be written as m/n with m and n terms of A259488.
This implies that there are infinitely many primes p with p+2 and prime(p)+2 both prime.
I have verified the conjecture for all those r = a/b with a,b = 1,...,400. - Zhi-Wei Sun, Jun 29 2015

			a(1) = 2 since prime(2)+2 = 3+2 = 5 and prime(prime(2))+2 = prime(3)+2 = 7 are both prime, but prime(1)+2 = 4 is composite.
a(49) = 7 since prime(7)+2 = 17+2 = 19, prime(prime(7))+2 = prime(17)+2 = 59+2 = 61, prime(49*7)+2 = 2309+2 = 2311 and prime(prime(49*7))+2 = prime(2309)+2 = 20441+2 = 20443 are all 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..5000
Zhi-Wei Sun, Checking the conjecture for r = a/b with a,b = 1..400
Zhi-Wei Sun, Problems on combinatorial properties of primes, arXiv:1402.6641 [math.NT], 2014.

Cf. A000040, A001359, A006512, A236458, A258803, A258836, A259488, A259492.

PQ[k_]:=PrimeQ[Prime[k]+2]&&PrimeQ[Prime[Prime[k]]+2]
Do[k=0;Label[bb];k=k+1;If[PQ[k]&&PQ[n*k], Goto[aa], Goto[bb]];Label[aa];Print[n," ", k];Continue,{n,1,60}]

A373402 Numbers k such that the k-th maximal antirun of prime numbers > 3 has length different from all prior maximal antiruns. Sorted list of positions of first appearances in A027833.

Original entry on oeis.org

1, 2, 4, 6, 8, 10, 21, 24, 30, 35, 40, 41, 46, 50, 69, 82, 131, 140, 185, 192, 199, 210, 248, 251, 271, 277, 325, 406, 423, 458, 645, 748, 811, 815, 826, 831, 987, 1053, 1109, 1426, 1456, 1590, 1629, 1870, 1967, 2060, 2371, 2607, 2920, 2946, 3564, 3681, 4119

Offset: 1

Gus Wiseman, Jun 10 2024

nonn

The unsorted version is A373401.

For this sequence, we define an antirun to be an interval of positions at which consecutive primes differ by at least 3.

			The maximal antiruns of prime numbers > 3 begin:
    5
    7  11
   13  17
   19  23  29
   31  37  41
   43  47  53  59
   61  67  71
   73  79  83  89  97 101
  103 107
  109 113 127 131 137
  139 149
  151 157 163 167 173 179
The a(n)-th rows begin:
    5
    7  11
   19  23  29
   43  47  53  59
   73  79  83  89  97 101
  109 113 127 131 137

Gus Wiseman, Four statistics for runs and antiruns of prime, nonprime, squarefree, and nonsquarefree numbers.

For squarefree runs we have the triple (1,3,5), firsts of A120992.
For prime runs we have the triple (1,2,3), firsts of A175632.
For nonsquarefree runs we have A373199 (assuming sorted), firsts of A053797.
For squarefree antiruns: A373200, unsorted A373128, firsts of A373127.
For composite runs we have A373400, unsorted A073051.
The unsorted version is A373401, firsts of A027833.
For composite antiruns we have the triple (1,2,7), firsts of A373403.
A000040 lists the primes, differences A001223.
A002808 lists the composite numbers, differences A073783.
A046933 counts composite numbers between primes.
A065855 counts composite numbers up to n.
Cf. A006512, A007674, A049093, A068781, A072284, A077641, A174965, A251092, A373198, A373408, A373411.

t=Length/@Split[Select[Range[4,10000],PrimeQ],#1+2!=#2&]//Most;
Select[Range[Length[t]],FreeQ[Take[t,#-1],t[[#]]]&]

A051779 Primes of form pq + 2 where p and q are twin primes.

Original entry on oeis.org

17, 37, 22501, 32401, 57601, 72901, 176401, 324901, 1664101, 1742401, 5336101, 6502501, 7452901, 11289601, 11492101, 18147601, 21622501, 34222501, 34574401, 40449601, 45968401, 81000001, 85377601, 92736901, 110880901, 118592101

Offset: 1

Joe DeMaio (jdemaio(AT)kennesaw.edu), Dec 09 1999

Starting with 3rd term, 22501, all terms are of the form 900n^2+1 with n=5, 6, 8, 9, 14, 19, 43, 44, 77, 85 (A125251). - Zak Seidov, Dec 07 2008

Primes of the form (p^2 + q^2)/2, where p and q are twin primes. - Thomas Ordowski and Altug Alkan, Mar 19 2017

			The third term 22501 is a member of the sequence because 22501=149*151+2, 22501 is prime and {149,151} is a twin prime pair.

Giovanni Resta, Table of n, a(n) for n = 1..10000

Cf. A048880, A051779, A000040, A001359, A005384, A006512, A037074, A054735.

Cf. A125251. - Zak Seidov, Dec 07 2008

with (numtheory): for n from 1 to 2000 do if (ithprime(n+1)-ithprime(n)=2) then if (tau(ithprime(n)*ithprime(n+1)+2)=2) then print(ithprime(n),ithprime(n+1), ithprime(n)*ithprime(n+1)+2); fi; fi; od;

lst={};Do[p=Prime[n];If[Length[Divisors[p-2]]==4&&(Divisors[p-2][[3]]-Divisors[p-2][[2]])==2, AppendTo[lst, p]], {n, 6*10^5}];lst (* Vladimir Joseph Stephan Orlovsky, Aug 08 2008 *)
Select[(First[#]Last[#]+2)&/@Select[Partition[Prime[Range[2700]], 2,1], Last[#]-First[#]==2&],PrimeQ]  (* Harvey P. Dale, Mar 11 2011 *)
Select[2 + Times @@@ Select[ Partition[ Prime@ Range@ 1350, 2, 1], First[#] + 2 == Last[#] &], PrimeQ] (* Robert G. Wilson v, Mar 12 2001 *)

{A037074(k) + 2} INTERSECT {A000040}. {A001359(k) * A006512(k) + 2} INTERSECT {A000040}. {A054735(k)^2 + 2*A054735(k) + 2} INTERSECT {A000040}. - Jonathan Vos Post, May 11 2006

Edited by R. J. Mathar, Aug 08 2008

A070155 Numbers k such that k-1, k+1 and k^2+1 are prime numbers.

Original entry on oeis.org

4, 6, 150, 180, 240, 270, 420, 570, 1290, 1320, 2310, 2550, 2730, 3360, 3390, 4260, 4650, 5850, 5880, 6360, 6780, 9000, 9240, 9630, 10530, 10890, 11970, 13680, 13830, 14010, 14550, 16230, 16650, 18060, 18120, 18540, 19140, 19380, 21600, 21840

Offset: 1

Labos Elemer, Apr 23 2002

Essentially the same as A129293. - R. J. Mathar, Jun 14 2008
Solutions to the equation: A000005(n^4-1) = 8. - Enrique Pérez Herrero, May 03 2012
Terms > 6 are multiples of 30. Subsequence of A070689. - Zak Seidov, Nov 12 2012
{a(n)-1} is a subsequence of A157468; for n>1, {a(n)^2+2} is a subsequence of A242720. - Vladimir Shevelev, Aug 31 2014

			150 is a term since 149, 151 and 22501 are all primes.

Amiram Eldar, Table of n, a(n) for n = 1..10000 (terms 1..1000 from Harvey P. Dale)

Cf. A000005, A000720, A001359, A006512, A014574, A002496, A005574, A070156, A070689, A129293, A157468, A242720.

select(n -> isprime(n-1) and isprime(n+1) and isprime(n^2+1), [seq(2*i,i=1..10000)]); # Robert Israel, Sep 02 2014

Do[s=n; If[PrimeQ[s-1]&&PrimeQ[s+1]&&PrimeQ[1+s^2], Print[n]], {n, 1, 1000000}]
Select[Range[22000],AllTrue[{#+1,#-1,#^2+1},PrimeQ]&] (* The program uses the AllTrue function from Mathematica version 10 *) (* Harvey P. Dale, Dec 19 2014 *)

is(k) = isprime(k-1) && isprime(k+1) && isprime(k^2+1); \\ Amiram Eldar, Apr 15 2024

For n>1, a(n)^2 = A242720(pi(a(n)-2)) - 2, where pi(n) is the prime counting function (A000720). - Vladimir Shevelev, Sep 02 2014

A228557 Determinant of the n X n matrix with (i,j)-entry equal to 1 or 0 according as i + j and i + j + 2 are twin primes or not.

Original entry on oeis.org

0, -1, 0, 1, 0, -1, 0, 1, 0, 0, 0, 0, 0, -1, 0, 1, 0, -1, 0, 1, 0, -1, 0, 0, 0, 0, 0, 0, 0, -1, 0, 1, 0, -1, 0, 1, 0, -1, 0, 1, 0, -4, 0, 64, 0, -324, 0, 81, 0, -1, 0, 16, 0, 0, 0, 0, 0, 0, 0, 0

Offset: 1

Zhi-Wei Sun, Aug 25 2013

sign

Clearly p is odd if p and p + 2 are twin primes. If sigma is a permutation of {1,...,n}, and i + sigma (i) and i + sigma(i) + 2 are twin primes for all i = 1,...,n, then we must have sum_{i=1}^n (i + sigma(i)) == n (mod 2) and hence n is even. Therefore  a(n) = 0 if n is odd.
By the general result mentioned in A228591, (-1)^n*a(2*n) equals the square of A228615(n).
Zhi-Wei Sun made the following general conjecture:
Let d be any positive even integer, and let D(d,n) be the n X n determinant with (i,j)-entry eual to 1 or 0 according as i + j and i + j + d are both prime or not. Then D(d,2*n) is nonzero for large n.
Note that when n is odd we have D(d,n) = 0 (just like a(n) = 0). Also, the conjecture implies de Polignac's conjecture that there are infinitely many primes p such that p and p + d are both prime.

			a(1) = 0 since {2, 4} is not a twin prime pair.

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

Cf. A001359, A006512, A228615, A069191, A071524, A228591, A228552, A228548, A228549, A228559, A228561, A228574, A228578.

a[n_]:=a[n]=Det[Table[If[PrimeQ[i+j]==True&&PrimeQ[i+j+2]==True,1,0],{i,1,n},{j,1,n}]]
Table[a[n],{n,1,100}]

A230141 Number of ways to write n = x + y + z with y <= z such that 6x-1, 6y-1, 6z-1 are terms of A230138 and 6(y+z)+1 is prime.

Original entry on oeis.org

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

Offset: 1

Zhi-Wei Sun, Oct 10 2013

nonn

Conjecture: a(n) > 0 for all n > 2. Also, any integer n > 2 can be written as x + y + z (x, y, z > 0) such that 6*x-1, 6*y-1, 6*z-1 are terms of A230138 and 6*y*z-1 is prime.
This is a further refinement of the conjecture in A230140.
Note that if x + y + z = n then 6*n = (6*x-1) + (6*(y+z)+1). So a(n) > 0 implies Goldbach's conjecture for the even number 6*n.

			a(10) = 2 since 10 = 3 + 2 + 5 = 5 + 2 + 3, and 6*3-1 = 17, 6*2-1 = 11, 6*5-1 = 29 are terms of A230138, and 6*(2+5)+1 = 43 and 6*(2+3)+1 = 31 are also 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.

Cf. A001359, A006512, A002375, A068307, A230138, A230140.

SQ[n_]:=PrimeQ[6n-1]&&PrimeQ[6n+1]&&PrimeQ[12n-7]
a[n_]:=Sum[If[SQ[i]&&PrimeQ[6(n-i)+1]&&SQ[j]&&SQ[n-i-j],1,0],{i,1,n-2},{j,1,(n-i)/2}]
Table[a[n],{n,1,100}]

A236456 Number of ordered ways to write n = k + m with k > 0 and m > 0 such that p = phi(k) + phi(n-k)/4 - 1, q = p + 2 and r = prime(q) + 2 are all prime, where phi(.) is Euler's totient function.

Original entry on oeis.org

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

Offset: 1

Zhi-Wei Sun, Jan 26 2014

nonn

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

This is much stronger than the twin prime conjecture. Actually it implies that there are infinitely many primes p such that {p, p + 2} and {prime(p+2), prime(p+2) + 2} are both twin prime pairs. See A236457 for such primes p.

			a(18) = 1 since 18 = 3 + 15 with phi(3) + phi(15)/4 - 1  = 3,  3 + 2 = 5 and prime(5) + 2 = 13 all prime.
a(50) = 1 since 50 = 16 + 34 with phi(16) + phi(34)/4 - 1 = 11, 11 + 2 = 13 and prime(13) + 2 = 43 all prime.
a(929) = 1 since 929 = 441 + 488 with phi(441) + phi(488)/4 - 1 = 252 + 60 - 1 = 311, 311 + 2 = 313 and prime(313) + 2 = 2083 all prime.

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

Cf. A000010, A000040, A001359, A006512, A236097, A236457, A236458.

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

cp's OEIS Frontend

A219157 Number of prime pairs {p,q} with p>q and p-2,q+2 also prime such that p+(1+mod(-n,6))q=n if n is not congruent to 2 mod 6, and p-q=n and q

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A219185 Number of prime pairs {p,q} (p>q) with 3(p-q)-1 and 3(p-q)+1 both prime such that p+(1+(n mod 2))q=n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A236531 a(n) = |{0 < k < n: {6*k -1 , 6*k + 1} and {prime(n-k), prime(n-k) + 2} are both twin prime pairs}|.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A259487 Least positive integer m with prime(m)+2 and prime(prime(m))+2 both prime such that prime(m*n)+2 and prime(prime(m*n))+2 are both prime.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

A373402 Numbers k such that the k-th maximal antirun of prime numbers > 3 has length different from all prior maximal antiruns. Sorted list of positions of first appearances in A027833.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A051779 Primes of form pq + 2 where p and q are twin primes.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A070155 Numbers k such that k-1, k+1 and k^2+1 are prime numbers.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A228557 Determinant of the n X n matrix with (i,j)-entry equal to 1 or 0 according as i + j and i + j + 2 are twin primes or not.

A236531 a(n) = |{0 < k < n: {6k -1 , 6k + 1} and {prime(n-k), prime(n-k) + 2} are both twin prime pairs}|.

A259487 Least positive integer m with prime(m)+2 and prime(prime(m))+2 both prime such that prime(mn)+2 and prime(prime(mn))+2 are both prime.

A230141 Number of ways to write n = x + y + z with y <= z such that 6x-1, 6y-1, 6z-1 are terms of A230138 and 6(y+z)+1 is prime.