cp's OEIS Frontend

A235189 Number of ways to write n = (1 + (n mod 2))*p + q with p < n/2 such that p, q and prime(p) - p + 1 are all prime.

%I A235189 #10 Apr 06 2014 04:07:37
%S A235189 0,0,0,0,0,0,1,1,2,1,2,1,2,1,2,2,4,2,2,2,3,2,3,2,2,2,3,1,3,2,2,2,4,2,
%T A235189 2,4,4,1,3,2,3,2,3,3,4,3,4,3,3,3,5,2,4,4,2,2,6,2,2,4,1,1,5,4,5,4,4,2,
%U A235189 4,3,3,3,4,4,5,4,5,4,3,2,4,2,3,6,5,3,6,3,5,5,2,3,9,3,3,5,3,1,6,3
%N A235189 Number of ways to write n = (1 + (n mod 2))*p + q with p < n/2 such that p, q and prime(p) - p + 1 are all prime.
%C A235189 Conjecture: a(n) > 0 for all n > 6.
%C A235189 This implies both Goldbach's conjecture (A045917) and Lemoine's conjecture (A046927). For primes p with prime(p) - p + 1 also prime, see A234695.
%H A235189 Zhi-Wei Sun, <a href="/A235189/b235189.txt">Table of n, a(n) for n = 1..10000</a>
%H A235189 Z.-W. Sun, <a href="http://arxiv.org/abs/1402.6641">Problems on combinatorial properties of primes</a>, arXiv:1402.6641, 2014
%e A235189 a(10) = 1 since 10 = 3 + 7 with 3, 7 and prime(3) - 3 + 1 = 3 all prime.
%e A235189 a(28) = 1 since 28 = 5 + 23 with 5, 23 and prime(5) - 4 = 7 all prime.
%e A235189 a(61) = 1 since 61 = 2*7 + 47 with 7, 47 and prime(7) - 6 = 11 all prime.
%e A235189 a(98) = 1 since 98 = 31 + 67 with 31, 67 and prime(31) - 30 = 97 all prime.
%t A235189 p[n_]:=PrimeQ[Prime[n]-n+1]
%t A235189 a[n_]:=Sum[If[p[Prime[k]]&&PrimeQ[n-(1+Mod[n,2])*Prime[k]],1,0],{k,1,PrimePi[(n-1)/2]}]
%t A235189 Table[a[n],{n,1,100}]
%Y A235189 Cf. A000040, A045917, A046927, A234694, A234695, A235187.
%K A235189 nonn
%O A235189 1,9
%A A235189 _Zhi-Wei Sun_, Jan 04 2014