OFFSET
1,1
COMMENTS
Sequence contains "many" pairs of cousin primes. More exactly, our conjectures are: (1) sequence contains almost all cousin primes; (2)for x >= 107, c(x)/A(x) > C(x)/pi(x), where A(x), c(x) and C(x) are the counting functions for this sequence, cousin pairs in this sequence and all cousin pairs respectively.
Indeed (a heuristic argument), a number n in the middle of a randomly chosen pair of cousin primes may be considered as a random integer.
The probability that n has no more than two prime divisors is, as well known, O((log(log n)/log n), i.e., it is natural to conjecture that almost all cousin pairs are in the sequence. Furthermore, it is natural to conjecture that the inequality is true as well, since A(x) < pi(x).
Probably this sequence contains almost all primes and so a(n) ~ n log n. - Charles R Greathouse IV, Sep 24 2013
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 1..10000
MATHEMATICA
Select[Prime[Range[200]], PrimeNu[# - 2] > 2 || PrimeNu[# + 2] > 2 &] (* Alonso del Arte, Dec 23 2010 *)
PROG
(PARI) is(n)=isprime(n) && n>9 && (omega(n-2)>2||omega(n+2)>2) \\ Charles R Greathouse IV, Sep 24 2013
CROSSREFS
KEYWORD
nonn
AUTHOR
Vladimir Shevelev, Dec 23 2010
STATUS
approved