cp's OEIS Frontend

A199800 Number of ways to write n = p+q with p, 6q-1 and 6q+1 all prime.

%I A199800 #16 Jul 22 2025 13:23:32
%S A199800 0,0,1,2,2,2,2,3,2,3,0,4,2,4,3,2,2,3,3,5,3,3,3,4,4,3,2,4,3,5,3,4,3,5,
%T A199800 5,6,3,4,3,5,5,5,6,5,4,5,5,6,7,5,4,5,4,7,6,4,4,4,5,6,6,5,6,7,4,5,2,4,
%U A199800 7,5,7,4,5,6,7,7,7,5,6,4,7,4,7,7,6,5,3,5,8,7,7,5,5,6,4,5,4,5,8,7
%N A199800 Number of ways to write n = p+q with p, 6q-1 and 6q+1 all prime.
%C A199800 Conjecture: a(n)>0 for all n>11.
%C A199800 This implies the twin prime conjecture, and it has been verified for n up to 10^9.
%C A199800 Zhi-Wei Sun also made some similar conjectures, for example, any integer n>5 can be written as p+q with p, 2q-3 and 2q+3 all prime, and each integer n>4 can be written as p+q with p, 3q-2+(n mod 2) and 3q+2-(n mod 2) all prime.
%H A199800 Zhi-Wei Sun, <a href="/A199800/b199800.txt">Table of n, a(n) for n = 1..10000</a>
%H A199800 Zhi-Wei Sun, <a href="http://arxiv.org/abs/1211.1588">Conjectures involving primes and quadratic forms</a>, arXiv:1211.1588.
%e A199800 a(3)=1 since 3=2+1 with 2, 6*1-1 and 6*1+1 all prime.
%t A199800 a[n_]:=a[n]=Sum[If[PrimeQ[n-k]==True&&PrimeQ[6k-1]==True&&PrimeQ[6k+1]==True,1,0],{k,1,n-1}]
%t A199800 Do[Print[n," ",a[n]],{n,1,100}]
%Y A199800 Cf. A001359, A006512, A220419, A220413, A173587, A220272, A219842, A219864, A219923.
%K A199800 nonn
%O A199800 1,4
%A A199800 _Zhi-Wei Sun_, Dec 21 2012