A065421 -id:A065421 - cp's OEIS frontend

A001097 Twin primes.

3, 5, 7, 11, 13, 17, 19, 29, 31, 41, 43, 59, 61, 71, 73, 101, 103, 107, 109, 137, 139, 149, 151, 179, 181, 191, 193, 197, 199, 227, 229, 239, 241, 269, 271, 281, 283, 311, 313, 347, 349, 419, 421, 431, 433, 461, 463, 521, 523, 569, 571, 599, 601, 617, 619, 641, 643

Offset: 1

N. J. A. Sloane, Mar 15 1996

Union of A001359 and A006512.
The only twin primes that are Fibonacci numbers are 3, 5 and 13 [MacKinnon]. - Emeric Deutsch, Apr 24 2005
(p, p+2) are twin primes if and only if p + 2 can be represented as the sum of two primes. Brun (1919): Even if there are infinitely many twin primes, the series of all twin prime reciprocals does converges to [Brun's constant] (A065421). Clement (1949): For every n > 1, (n, n+2) are twin primes if and only if 4((n-1)! + 1) == -n (mod n(n+2)). - Stefan Steinerberger, Dec 04 2005
A164292(a(n)) = 1. - Reinhard Zumkeller, Mar 29 2010
The 100355-digit numbers 65516468355 * 2^333333 +- 1 are currently the largest known twin prime pair. They were discovered by Twin Prime Search and Primegrid in August 2009. - Paul Muljadi, Mar 07 2011
For every n > 2, the pair (n, n+2) is a twin prime if and only if ((n-1)!!)^4 == 1 (mod n*(n+2)). - Thomas Ordowski, Aug 15 2016
The term "twin primes" ("primzahlzwillinge", in German) was coined by the German mathematician Paul Gustav Samuel Stäckel (1862-1919) in 1916. Brun (1919) used the same term in French ("nombres premiers jumeaux"). Glaisher (1878) and Hardy and Littlewood (1923) used the term "prime-pairs". The term "twin primes" in English was used by Dantzig (1930). - Amiram Eldar, May 20 2023

Tobias Dantzig, Number: The Language of Science, Macmillan, 1930.
Paulo Ribenboim, The New Book of Prime Number Records, Springer-Verlag, 1996, pp. 259-265.
David Wells, The Penguin Dictionary of Curious and Interesting Numbers. Penguin Books, NY, 1986, Revised edition 1987. See p. 132.

T. D. Noe, Table of n, a(n) for n = 1..10000
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972, p. 870.
Viggo Brun, La série 1/5 + 1/7 + 1/11 + 1/13 + 1/17 + 1/19 + 1/29 + 1/31 + 1/41 + 1/43 + 1/59 + 1/61 + ... où les dénominateurs sont "nombres premiers jumeaux" est convergente ou finie, Bull Sci. Math. 43 (1919), 100-104 and 124-128.
J. P. Delahaye, Premiers jumeaux: frères ennemis? [Twin primes: Enemy Brothers?], Pour la science, No. 260 (Juin 1999), 102-106.
Harvey Dubner, Twin Prime Statistics, Journal of Integer Sequences, Vol. 8 (2005), Article 05.4.2.
J. C. Evard, Twin primes and their applications. [Cached copy on the Wayback Machine]
J. C. Evard, Twin primes and their applications. [Local cached copy]
J. C. Evard, Twin primes and their applications. [Pdf file of cached copy]
J. W. L. Glaisher, An enumeration of prime-pairs, Messenger of Mathematics, Vol. 8 (1878), pp. 28-33.
Andrew Granville, Primes in intervals of bounded length, Joint Math Meeting, Current Events Bulletin, Baltimore, Friday, Jan 17 2014.
G. H. Hardy and J. E. Littlewood, Some problems of 'Partitio numerorum'; III: On the expression of a number as a sum of primes, Acta Mathematica, Vol. 44, No. 1 (1923), pp. 1-70; alternative link.
Nick MacKinnon, Problem 10844, Amer. Math. Monthly 109, (2002), p. 78.
James Maynard, Small gaps between primes, Annals of Mathematics, Second series, Vol. 181, No. 1 (2015), pp. 383-413; arXiv preprint, arXiv:1311.4600 [math.NT], 2013-2019.
Omar E. Pol, Determinacion geometrica de los numeros primos y perfectos.
D. H. J. Polymath, New equidistribution estimates of Zhang type, and bounded gaps between primes, arXiv:1402.0811 [math.NT], 2014.
D. H. J. Polymath, Variants of the Selberg sieve, and bounded intervals containing many primes, arXiv:1407.4897 [math.NT], 2014.
Paul Stäckel, Die Darstellung der geraden Zahlen als Summen von zwei Primzahlen, Sitzungsberichte der Heidelberger Akademie der Wissenschaften, Mathematisch-naturwissenschaftliche Klasse (in German), Abt. A, Bd. 10 (1916), pp. 1-47. See p. 22.
Eric Weisstein's World of Mathematics, Twin Primes.
Yitang Zhang, Bounded gaps between primes, Annals of Mathematics, Volume 179, Issue 3 (2014), Pages 1121-1174.
Index entries for "core" sequences.
Index entries for primes, gaps between.

Cf. A070076, A001359, A006512, A164292. See A077800 for another version.

a001097 n = a001097_list !! (n-1)
a001097_list = filter ((== 1) . a164292) [1..]
-- Reinhard Zumkeller, Feb 03 2014, Nov 27 2011

A001097 := proc(n)
    option remember;
    if n = 1 then
        3;
    else
        for a from procname(n-1)+1 do
            if isprime(a) and ( isprime(a-2) or isprime(a+2) ) then
                return a;
            end if;
        end do:
    end if;
end proc: # R. J. Mathar, Feb 19 2015

Select[ Prime[ Range[120]], PrimeQ[ # - 2] || PrimeQ[ # + 2] &] (* Robert G. Wilson v, Jun 09 2005 *)
Union[Flatten[Select[Partition[Prime[Range[200]],2,1],#[[2]]-#[[1]] == 2&]]] (* Harvey P. Dale, Aug 19 2015 *)

isA001097(n) = (isprime(n) && (isprime(n+2) || isprime(n-2))) \\ Michael B. Porter, Oct 29 2009

a(n)=if(n==1,return(3));my(p);forprime(q=3,default(primelimit), if(q-p==2 && (n-=2)<0, return(if(n==-1,q,p)));p=q) \\ Charles R Greathouse IV, Aug 22 2012

list(lim)=my(v=List([3]),p=5); forprime(q=7,lim, if(q-p==2, listput(v,p); listput(v,q)); p=q); if(p+2>lim && isprime(p+2), listput(v,p)); Vec(v) \\ Charles R Greathouse IV, Mar 17 2017

from sympy import nextprime
from itertools import islice
def agen(): # generator of terms
    yield 3
    p, q = 5, 7
    while True:
        if q - p == 2: yield from [p, q]
        p, q = q, nextprime(q)
print(list(islice(agen(), 58))) # Michael S. Branicky, Apr 30 2022

A077800 List of twin primes {p, p+2}.

Original entry on oeis.org

3, 5, 5, 7, 11, 13, 17, 19, 29, 31, 41, 43, 59, 61, 71, 73, 101, 103, 107, 109, 137, 139, 149, 151, 179, 181, 191, 193, 197, 199, 227, 229, 239, 241, 269, 271, 281, 283, 311, 313, 347, 349, 419, 421, 431, 433, 461, 463, 521, 523, 569, 571, 599, 601, 617, 619

Offset: 1

N. J. A. Sloane, Dec 03 2002

Union (with repetition) of A001359 and A006512.

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 870.

Vincenzo Librandi, Table of n, a(n) for n = 1..1000
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
Nicholas John Bizzell-Browning, LIE scales: Composing with scales of linear intervallic expansion, Ph. D. Thesis, Brunel Univ. (UK, 2024). See p. 144.
Jean-Paul Delahaye, Premiers jumeaux: frères ennemis? [Twin primes: Enemy Brothers?], Pour la science, No. 260 (Juin 1999), 102-106.
Jean-Claude Evard, Twin primes and their applications. [Cached copy on the Wayback Machine]
Jean-Claude Evard, Twin primes and their applications. [Local cached copy]
Jean-Claude Evard, Twin primes and their applications. [Pdf file of cached copy]
Dave Platt and Tim Trudgian, Improved bounds on Brun's constant, in: David H. Bailey et al. (eds), From Analysis to Visualization, JBCC 2017, Springer Proceedings in Mathematics & Statistics, Vol 313, Springer, Cham, 2020, preprint, arXiv:1803.01925 [math.NT], 2018.
Mario Raso, Integer Sequences in Cryptography: A New Generalized Family and its Application, Ph. D. Thesis, Sapienza University of Rome (Italy 2025). See p. 114.
Hayden Tronnolone, A tale of two primes, COLAUMS Space, #3, 2013.
Wikipedia, Twin prime.
Index entries for primes, gaps between

Cf. A065421, A070076, A095958. See A001097 for another version.

a077800 n = a077800_list !! (n-1)
a077800_list = concat $ zipWith (\p q -> if p == q+2 then [q,p] else [])
                                (tail a000040_list) a000040_list
-- Reinhard Zumkeller, Nov 27 2011

Sort[ Join[ Select[ Prime[ Range[ 115]], PrimeQ[ # - 2] &], Select[ Prime[ Range[ 115]], PrimeQ[ # + 2] &]]] (* Robert G. Wilson v, Jun 09 2005 *)
Select[ Partition[ Prime@ Range@ 115, 2, 1], #[[1]] + 2 == #[[2]] &] // Flatten
Flatten[Select[{#, # + 2} & /@Prime[Range[1000]], PrimeQ[Last[#]]&]] (* Vincenzo Librandi, Nov 01 2012 *)
Splice[{#,#+2}]& /@ Select[Prime[Range[PrimePi[619]]], PrimeQ[#+2]&] (* Oliver Seipel, Sep 04 2024 *)

p=2;forprime(q=3,1e3,if(q-p==2,print1(p", "q", "));p=q) \\ Charles R Greathouse IV, Mar 22 2013

Sum_{n>=1} 1/a(n) is in the interval (1.840503, 2.288490) (Platt and Trudgian, 2020). The conjectured value based on assumptions about the distribution of twin primes is A065421. - Amiram Eldar, Oct 15 2020

A005597 Decimal expansion of the twin prime constant C_2 = Product_{ p prime >= 3 } (1-1/(p-1)^2).

Original entry on oeis.org

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

Offset: 0

N. J. A. Sloane

C_2 = Product_{ p prime > 2} (p * (p-2) / (p-1)^2) is the 2-tuple case of the Hardy-Littlewood prime k-tuple constant (part of First H-L Conjecture): C_k = Product_{ p prime > k} (p^(k-1) * (p-k) / (p-1)^k).
Although C_2 is commonly called the twin prime constant, it is actually the prime 2-tuple constant (prime pair constant) which is relevant to prime pairs (p, p+2m), m >= 1.
The Hardy-Littlewood asymptotic conjecture for Pi_2m(n), the number of prime pairs (p, p+2m), m >= 1, with p <= n, claims that Pi_2m(n) ~ C_2(2m) * Li_2(n), where Li_2(n) = Integral_{2, n} (dx/log^2(x)) and C_2(2m) = 2 * C_2 * Product_{p prime > 2, p | m} (p-1)/(p-2), which gives: C_2(2) = 2 * C_2 as the prime pair (p, p+2) constant, C_2(4) = 2 * C_2 as the prime pair (p, p+4) constant, C_2(6) = 2* (2/1) * C_2 as the prime pair (p, p+6) constant, C_2(8) = 2 * C_2 as the prime pair (p, p+8) constant, C_2(10) = 2 * (4/3) * C_2 as the prime pair (p, p+10) constant, C_2(12) = 2 * (2/1) * C_2 as the prime pair (p, p+12) constant, C_2(14) = 2 * (6/5) * C_2 as the prime pair (p, p+14) constant, C_2(16) = 2 * C_2 as the prime pair (p, p+16) constant, ... and, for i >= 1, C_2(2^i) = 2 * C_2 as the prime pair (p, p+2^i) constant.
C_2 also occurs as part of other Hardy-Littlewood conjectures related to prime pairs, e.g., the Hardy-Littlewood conjecture concerning the distribution of the Sophie Germain primes (A156874) on primes p such that 2p+1 is also prime.
Another constant related to the twin primes is Viggo Brun's constant B (sometimes also called the twin primes Viggo Brun's constant B_2) A065421, where B_2 = Sum (1/p + 1/q) as (p,q) runs through the twin primes.
Reciprocal of the Selberg-Delange constant A167864. See A167864 for additional comments and references. - Jonathan Sondow, Nov 18 2009
C_2 = Product_{prime p>2} (p-2)p/(p-1)^2 is an analog for primes of Wallis' product 2/Pi = Product_{n=1 to oo} (2n-1)(2n+1)/(2n)^2. - Jonathan Sondow, Nov 18 2009
One can compute a cubic variant, product_{primes >2} (1-1/(p-1)^3) = 0.855392... = (2/3) * 0.6601618...* 1.943596... by multiplying this constant with 2/3 and A082695. - R. J. Mathar, Apr 03 2011
Cohen (1998, p. 7) referred to this number as the "twin prime and Goldbach constant" and noted that, conjecturally, the number of twin prime pairs (p,p+2) with p <= X tends to 2*C_2*X/log(X)^2 as X tends to infinity. - Artur Jasinski, Feb 01 2021

			0.6601618158468695739278121100145557784326233602847334133194484233354056423...

Henri Cohen, Number Theory, Volume II: Analytic and Modern Tools, GTM Vol. 240, Springer, 2007; see pp. 208-209.
Richard Crandall and Carl Pomerance, Prime Numbers: A Computational Perspective, Springer, NY, 2001; see p. 11.
Steven R. Finch, Mathematical Constants, Encyclopedia of Mathematics and its Applications, Vol. 94, Cambridge University Press, 2003, pp. 84-93, 133.
R. K. Guy, Unsolved Problems in Number Theory, Section A8.
G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 5th ed., Oxford Univ. Press, 1979, ch. 22.20.
Paulo Ribenboim, The Little Book of Bigger Primes, Springer-Verlag NY 2004. See pp. 194, 263-264.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Harry J. Smith, Table of n, a(n) for n = 0..1001
Folkmar Bornemann, PRIMES Is in P: Breakthrough for "Everyman", Notices Amer. Math. Soc., Vol. 50, No. 5 (May 2003), p. 549.
Paul S. Bruckman, Problem H-576, Advanced Problems and Solutions, The Fibonacci Quarterly, Vol. 39, No. 4 (2001), p. 379; General IZE, Solution to Problem H-576 by the proposer, ibid., Vol. 40, No. 4 (2002), pp. 383-384.
C. K. Caldwell, The Prime Glossary, twin prime constant.
Henri Cohen, High-precision computation of Hardy-Littlewood constants, (1998).
Henri Cohen, High-precision computation of Hardy-Littlewood constants. [pdf copy, with permission]
Steven R. Finch, Mathematical Constants, Errata and Addenda, arXiv:2001.00578 [math.HO], 2020, Sec. 2.1.
Philippe Flajolet and Ilan Vardi, Zeta Function Expansions of Classical Constants, Unpublished manuscript. 1996.
Daniel A. Goldston, Timothy Ngotiaoco and Julian Ziegler Hunts, The tail of the singular series for the prime pair and Goldbach problems, Functiones et Approximatio Commentarii Mathematici, Vol. 56, No. 1 (2017), pp. 117-141; arXiv preprint, arXiv:1409.2151 [math.NT], 2014.
R. J. Mathar, Hardy-Littlewood constants embedded into infinite products over all positive integers, arXiv:0903.2514 [math.NT], 2009-2011, constant T_1^(2).
B. H. Mayoh, The 2nd Goldbach conjecture revisited, BIT 8 (1968) 128-133 Table 5.
G. Niklasch, Some number theoretical constants: 1000-digit values. [Cached copy]
G. Niklasch, Twin primes constant.
Simon Plouffe, The twin primes constant.
Simon Plouffe, Plouffe's Inverter, The twin primes constant.
Pascal Sebah, Numbers, constants and computation (gives 5000 digits).
Eric Weisstein's World of Mathematics, Twin Primes Constant.
Eric Weisstein's World of Mathematics, Twin Prime Conjecture.
Eric Weisstein's World of Mathematics, k-Tuple Conjecture.
Eric Weisstein's World of Mathematics, Prime Constellation.
John W. Wrench, Jr., Evaluation of Artin's constant and the twin-prime constant, Math. Comp., Vol. 15, No. 76 (1961), pp. 396-398.

Cf. A065645 (continued fraction), A065646 (denominators of convergents to twin prime constant), A065647 (numerators of convergents to twin prime constant), A062270, A062271, A114907, A065418 (C_3), A167864, A000010, A008683.

s[n_] := (1/n)*N[ Sum[ MoebiusMu[d]*2^(n/d), {d, Divisors[n]}], 160]; C2 = (175/256)*Product[ (Zeta[n]*(1 - 2^(-n))*(1 - 3^(-n))*(1 - 5^(-n))*(1 - 7^(-n)))^(-s[n]), {n, 2, 160}]; RealDigits[C2][[1]][[1 ;; 105]] (* Jean-François Alcover, Oct 15 2012, after PARI *)
digits = 105; f[n_] := -2*(2^n-1)/(n+1); C2 = Exp[NSum[f[n]*(PrimeZetaP[n+1] - 1/2^(n+1)), {n, 1, Infinity}, NSumTerms -> 5 digits, WorkingPrecision -> 5 digits]]; RealDigits[C2, 10, digits][[1]] (* Jean-François Alcover, Apr 16 2016, updated Apr 24 2018 *)

\p1000; 175/256*prod(k=2,500,(zeta(k)*(1-1/2^k)*(1-1/3^k)*(1-1/5^k)*(1-1/7^k))^(-sumdiv(k,d,moebius(d)*2^(k/d))/k))

prodeulerrat(1-1/(p-1)^2, 1, 3) \\ Amiram Eldar, Mar 12 2021

Equals Product_{k>=2} (zeta(k)*(1-1/2^k))^(-Sum_{d|k} mu(d)*2^(k/d)/k). - Benoit Cloitre, Aug 06 2003
Equals 1/A167864. - Jonathan Sondow, Nov 18 2009
Equals Sum_{k>=1} mu(2*k-1)/phi(2*k-1)^2, where mu is the Möbius function (A008683) and phi is the Euler totient function (A000010) (Bruckman, 2001). - Amiram Eldar, Jan 14 2022

More terms from Vladeta Jovovic, Nov 08 2001
Commented and edited by Daniel Forgues, Jul 28 2009, Aug 04 2009, Aug 12 2009
PARI code removed by D. S. McNeil, Dec 26 2010

A209328 Decimal expansion of the sum of the inverse twin prime products.

Original entry on oeis.org

1, 0, 7, 9, 8, 3, 9, 7, 4, 9, 5

Offset: 0

R. J. Mathar, Jan 19 2013

Summation up to the lesser prime(100000) gives 0.1079839703839.., summation up to the lesser prime(5000000) gives 0.10798397490956.. and summation up to the lesser prime(100000000) gives 0.107983974949..

The constant splits Brun's constant B=A065421 into two portions: define L=Sum_{n>=1} 1/A001359(n) and U=Sum_{n>=1} 1/A006512(n). Then B=U+L and this constant here = (L-U)/2. This leads to the estimates L=1.059064 and U=0.843096. - R. J. Mathar, Feb 05 2013

			0.10798397495... = 1/(3*5) + 1/(5*7) + 1/(11*13) + .. = Sum_{n>=1} 1/A037074(n).

Cf. A001359, A006512, A037074, A065421.

A160910 Decimal expansion of c = sum over twin primes (p, p+2) of (1/p^2 + 1/(p+2)^2).

Original entry on oeis.org

2, 3, 7, 2, 5, 1, 7, 7, 6, 5, 7

Offset: 0

William Royle (seriesandsequences(AT)yahoo.com), May 29 2009

Compare Viggo Brun's constant (1/3 + 1/5) + (1/5 + 1/7) + (1/11 + 1/13) + (1/17 + 1/19) + (1/29 + 1/31) + ... (see A065421, A005597).
It appears that c = Sum 1/A001359(n)^2 + 1/A006512(n)^2. - R. J. Mathar, May 30 2009
0.237251776574746 < c < 0.237251776947124. - Farideh Firoozbakht, May 31 2009
c < 0.2725177657771. - Hagen von Eitzen, Jun 03 2009
From Farideh Firoozbakht, Jun 01 2009: (Start)
We can show that a(9)=6, a(10)=5, and a(11) is in the set {7, 8, 9}.
Proof: s1 = 0.237251776576249072... is the sum up to prime(499,000,000) and s2 = 0.237251776576250009... is the sum up to prime(500,000,000).
By using the fact that number of twin primes between the first 10^6*n primes and the first 10^6*(n+1) primes is decreasing (up to the first 2*10^9 primes), we conclude that the sum up to prime(2,000,000,000) is less than s2 + 1500*(s2-s1).
But since s2-s1 < 10^(-15), the sum up to prime(2*10^9) is less than s2 + 1.5*10^(-12) = 0.237251776576250009... + 1.5*10^(-12) = 0.237251776577550009... .
Hence the constant c is less than
0.237251776577550009... + lim(sum(1/k^2,{k, prime(2,000,000,001), n}, n -> infinity)
< 0.237251776577550009... + 2.12514*10^(-11)
< 0.237251776598801409.
So we have 0.237251776576250009 < c < 0.237251776598801409, hence a(9)=6, a(10)=5, and a(11) is in the set {7, 8, 9}.
I guess that a(11)=7. (End)
From Jon E. Schoenfield, Jan 02 2019: (Start)
Given that the Hardy-Littlewood approximation to the number of twin prime pairs < y is
     2 * C_2 * Integral_{x=2..y} dx/log(x)^2
  where C_2 = 0.660161815846869573927812110014555778432623 (see A152051), we can estimate the size of the tail of the summation Sum(1/A001359(j)^2) + 1/A006512(j)^2) for twin primes > y as
     t(y) = 2 * C_2 * Integral_{x>y} 2*dx/(x*log(x))^2.
Let s(y) be the sum of the squares of the reciprocals of all the twin primes <= y, and let s'(y) = s(y) + t(y) be the result of adding to the actual value s(y) the estimated tail size t(y). Evaluating s(y), t(y), and s'(y) at y = 2^d for d = 20..33 gives
.
   d        s(2^d)        t(2^d)*10^10    s(2^d) + t(2^d)
  == ==================== ============ ====================
  20 0.237251764919808326 115.34589710 0.237251776454398036
  21 0.237251771317612979  52.59702970 0.237251776577315949
  22 0.237251774173347724  24.08221952 0.237251776581569676
  23 0.237251775469086555  11.06766714 0.237251776575853269
  24 0.237251776066813995   5.10395459 0.237251776577209454
  25 0.237251776340760021   2.36119196 0.237251776576879217
  26 0.237251776467109357   1.09553336 0.237251776576662693
  27 0.237251776525743797   0.50967952 0.237251776576711749
  28 0.237251776552887645   0.23771866 0.237251776576659511
  29 0.237251776565549906   0.11113468 0.237251776576663374
  30 0.237251776571456873   0.05207020 0.237251776576663892
  31 0.237251776574218065   0.02444677 0.237251776576662742
  32 0.237251776575513036   0.01149984 0.237251776576663020
  33 0.237251776576121140   0.00541938 0.237251776576663078
.
which agrees with all the terms in the Data section and suggests likely values for additional terms.
(End)

			(1/9 + 1/25) + (1/25 + 1/49) + (1/121 + 1/169) + (1/289 + 1/361) + (1/841 + 1/961) + ... = 0.237251...

Various authors, On the computation of A160910

Cf. A001359, A005597, A006512, A065421, A152051.

R. J. Mathar pointed out that the value of c as originally submitted was incorrect (see link). - N. J. A. Sloane, May 31 2009
More terms from Farideh Firoozbakht and Hagen von Eitzen, Jun 01 2009
Name changed by Michael B. Porter, Jan 04 2019

A194098 Decimal expansion of sum of reciprocals of cousin primes.

Original entry on oeis.org

1, 1, 9, 7, 0, 4, 4, 9

Offset: 1

Kausthub Gudipati, Aug 15 2011

The value is obtained by summing cousin prime pairs with values less than 2^42 (which yields 1.10633...) and a logarithmic extrapolation of Brun's constant A065421.

The estimate by [Park-Lee] is 1.197054+-7e-6. - R. J. Mathar, Feb 09 2013

Yeonyong Park, Heonsoo Lee, On the several differences between primes, J. Appl. Math. & Computing 13 (2003) vol 1-2, pp 37-51.

Prime Curios!, Sum of reciprocals of cousin primes
Marek Wolf, On the Twin and Cousin Primes, (1996) IFTUWr 909/96
Marek Wolf, Generalized Brun's constants, (1997) IFTUWr 910/97
Eric E. Weisstein, MathWorld: Cousin primes

Equals 1.1970449... = (1/7+1/11)+(1/13+1/17)+.. = Sum_{n>=2} (1/A023200(n) + 1/A046132(n)).

A356793 Decimal expansion of sum of squares of reciprocals of lesser twin primes, Sum_{j>=1} 1/(A001359(j))^2.

Original entry on oeis.org

1, 6, 5, 6, 1, 8, 4, 6, 5, 3, 9, 5

Offset: 0

Artur Jasinski, Sep 04 2022

Alternative definition: sum of squares of reciprocals of primes whose distance from the next prime is equal to 2.
Convergence table:
   k       A001359(k)      Sum_{j=1..k} 1/A001359(j)^2
10000000   3285916169 0.165618465394273171950874120818
20000000   7065898967 0.165618465394707600197099741096
30000000  11044807451 0.165618465394836120901019351544
40000000  15151463321 0.165618465394895965582366015390
50000000  19358093939 0.165618465394930089884704869090
60000000  23644223231 0.165618465394951950670948192842
Using the Hardy-Littlewood prediction of the density of twin primes (see A347278), the contribution to the sum after the last entry in the table above can be estimated as 9.056*10^(-14), making the infinite sum ~= 0.16561846539504... . - Hugo Pfoertner, Sep 28 2022

			0.165618465395...

Jeffrey P.S. Lay, Sign changes in Mertens' first and second theorems, arXiv:1505.03589 [math.NT], 2015.
Mark B. Villarino, Mertens' Proof of Mertens' Theorem, arXiv:math/0504289 [math.HO], 2005.
Marek Wolf, Generalized Brun's constants, IFTUWr 910/97 (1998), 1-15.
Marek Wolf, Some heuristics on the gaps between consecutive primes, arXiv:1102.0481 [math.NT]. 2011.

Cf. A006512, A065421, A077800, A078437, A085548, A096247, A160910, A194098, A209328, A209329, A242301, A242302, A242303, A242304, A306539, A342714.

Cf. A347278.

Data extended to ...3, 9, 5 by Hugo Pfoertner, Sep 28 2022

cp's OEIS Frontend

A001097 Twin primes.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

PARI

PARI

Python

A077800 List of twin primes {p, p+2}.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Haskell

Mathematica

PARI

Formula

A005597 Decimal expansion of the twin prime constant C_2 = Product_{ p prime >= 3 } (1-1/(p-1)^2).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

Extensions

A209328 Decimal expansion of the sum of the inverse twin prime products.

Views

Author

Keywords

Comments

Examples

Crossrefs

A160910 Decimal expansion of c = sum over twin primes (p, p+2) of (1/p^2 + 1/(p+2)^2).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Extensions

A194098 Decimal expansion of sum of reciprocals of cousin primes.

Views

Author

Keywords

Comments

References

Links

Formula

A356793 Decimal expansion of sum of squares of reciprocals of lesser twin primes, Sum_{j>=1} 1/(A001359(j))^2.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Extensions

A306539 Decimal expansion of Sum (1/p - 1/q) as (p, q) runs through the twin primes.

Views