editing
approved
editing
approved
(Haskell)
a159700 n = length $ filter (\(p, q) -> p < q - 2 && a164292 q == 1) $
zip ps (map (2 * n -) ps)
where ps = filter ((== 1) . a164292) [1..n]
-- Reinhard Zumkeller, Mar 13 2014
Cf. A164292.
approved
editing
editing
approved
nonn,look
approved
editing
_Pierre CAMI (pierre-cami(AT)bbox.fr), _, Apr 20 2009
Pierre CAMI (pierre-cami(AT)orangebbox.fr), Apr 20 2009
Pierre CAMI, <a href="/A159700/b159700.txt">Table of n, a(n) for n=1..50000</a>
nonn,new
nonn
Number of different pairs of primes p,q such that : p<(q-2), p is a twin prime of p-2 or p+2 and q is a twin prime of q-2 or q+2, 2*n=p+q
0, 0, 0, 0, 1, 0, 1, 2, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 1, 1, 2, 2, 3, 4, 2, 1, 2, 1, 1, 2, 2, 2, 2, 1, 2, 4, 3, 3, 4, 2, 1, 2, 1, 2, 4, 2, 0, 0, 0, 2, 4, 3, 2, 2, 2, 4, 6, 3, 2, 4, 2, 1, 2, 1, 2, 4, 2, 1, 2, 2, 3, 4, 2, 2, 4, 3, 3, 4, 2, 2, 4, 2, 3, 6, 3, 1, 2, 1, 3, 6, 4, 2, 2, 1, 2, 4, 3, 4, 6, 4, 3, 4, 2, 6, 12
1,8
conjecture : for n>2104 there is at least one such pair of primes p+q=2*n
Pierre CAMI, <a href="b159700.txt">Table of n, a(n) for n=1..50000</a>
3+13=16,5+11=16 so for n=8 2 pairs p,q such that p+q=2*8, p<(q-2) p and q have a twin prime
nonn
Pierre CAMI (pierre-cami(AT)orange.fr), Apr 20 2009
approved