cp's OEIS Frontend

A237253 Number of ordered ways to write n = k + m with k > 0 and m > 0 such that phi(k) - 1, phi(k) + 1 and prime(prime(prime(m))) - 2 are all prime, where phi(.) is Euler's totient function.

%I A237253 #6 Feb 05 2014 08:49:45
%S A237253 0,0,0,0,0,1,0,2,1,2,2,1,2,1,2,1,1,1,2,2,3,4,2,2,1,2,3,3,3,2,4,5,4,3,
%T A237253 4,3,5,4,4,6,6,7,5,5,6,3,4,3,6,5,6,5,3,6,5,6,3,3,5,3,5,4,3,4,3,6,4,3,
%U A237253 1,1,4,3,4,4,4,5,6,7,3,3
%N A237253 Number of ordered ways to write n = k + m with k > 0 and m > 0 such that phi(k) - 1, phi(k) + 1 and prime(prime(prime(m))) - 2 are all prime, where phi(.) is Euler's totient function.
%C A237253 Conjecture: (i) a(n) > 0 for all n > 7.
%C A237253 (ii) Any integer n > 22 can be written as k + m with k > 0 and m > 0 such that prime(k) + 2 and prime(prime(prime(m))) - 2 are both prime.
%C A237253 Note that either part of the conjecture implies the twin prime conjecture.
%H A237253 Zhi-Wei Sun, <a href="/A237253/b237253.txt">Table of n, a(n) for n = 1..10000</a>
%e A237253  a(12) = 1 since 12 = 9 + 3 with phi(9) - 1 = 5, phi(9) + 1 = 7 and prime(prime(prime(3))) - 2 = prime(prime(5)) - 2 = prime(11) - 2 = 29 all prime.
%e A237253 a(103) = 1 since 103 = 73 + 30 with phi(73) - 1 = 71, phi(73) + 1 = 73 and prime(prime(prime(30))) - 2 = prime(prime(113)) - 2 = prime(617) - 2 = 4547 all prime.
%t A237253 pq[n_]:=PrimeQ[EulerPhi[n]-1]&&PrimeQ[EulerPhi[n]+1]
%t A237253 PQ[n_]:=PrimeQ[Prime[Prime[Prime[n]]]-2]
%t A237253 a[n_]:=Sum[If[pq[k]&&PQ[n-k],1,0],{k,1,n-1}]
%t A237253 Table[a[n],{n,1,80}]
%Y A237253 Cf. A000010, A000040, A001359, A006512, A072281, A218829, A236531, A236566, A237127, A237130, A237168.
%K A237253 nonn
%O A237253 1,8
%A A237253 _Zhi-Wei Sun_, Feb 05 2014