Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #17 May 13 2013 01:49:06
%S 1,1,0,2,0,1,0,1,0,1,0,2,0,0,0,2,0,1,0,1,0,1,0,2,0,0,0,1,0,1,0,1,0,0,
%T 0,3,0,0,0,2,0,1,0,1,0,1,0,1,0,0,0,1,0,0,0,1,0,1,0,3,0,0,0,1,0,1,0,0,
%U 0,1,0,4,0,0,0,0,0,1,0,1,0,1,0,1,0,0,0,2,0,0,0,1,0,0,0,2,0,0,0,2,0,1,0,1,0
%N Number of ways to write n as p*q-(p+q) with primes p <= q.
%C The only even number which can be written in the given way is n=0=2*2-(2+2), since if q an odd prime, pq-(p+q) is always odd.
%C Erdős shows that this sequence is unbounded. In particular, for any e > 0, there are infinitely many n such that a(n) > exp(sqrt(log n) - e). - _Charles R Greathouse IV_, Dec 05 2012
%C The number n = A218862(k) tells where a(n) is first equal to k. - _T. D. Noe_, Dec 06 2012
%H T. D. Noe, <a href="/A157187/b157187.txt">Table of n, a(n) for n = 0..10000</a>
%H P. Erdős, <a href="http://www.renyi.hu/~p_erdos/1936-08.pdf">On the integers which are the totient of a product of two primes</a>, Quart. J. Math., Oxford Ser. 7 (1936), pp. 227-229.
%F a(13+20n) = 0 for all n. - _T. D. Noe_, Dec 06 2012
%e a(0)=1 since 0=2*2-(2+2) is the only possibility.
%e a(1)=1 since 1=2*3-(2+3) is the only possibility.
%e a(2)=0 since 2 cannot be written as pq-(p+q) for primes p,q.
%e a(3)=2 since 3 = 2*5-(2+5) = 3*3-(3+3) are the two possibilities.
%e a(15437822399)=100 since p can be taken to be any of {13, 41, 43, 109, 113, 151, 181, 199, 271, 401, 613, 617, 661, 673, 859, 883, 919, 1021, 1123, 1201, 1249, 1471, 1801, 1871, 1951, 2003, 2269, 2647, 2731, 2861, 3169, 3511, 3571, 4159, 4999, 5281, 5881, 6007, 6427, 7057, 7393, 7481, 7841, 9241, 9521, 10193, 12241, 12377, 12853, 13729, 15401, 15913, 16831, 17551, 18701, 20593, 21169, 22051, 22441, 23801, 26951, 27541, 28051, 30577, 30941, 32341, 32401, 34273, 34651, 36037, 36721, 40801, 42043, 46411, 47521, 48049, 51481, 53857, 57331, 59671, 63649, 65521, 66529, 70687, 72931, 76441, 77617, 78541, 87517, 91631, 92401, 96097, 97241, 101921, 102103, 103951, 117811, 120121, 122401, 123553}.
%t nn = 100; ps = Prime[Range[PrimePi[nn + 1]]]; t = Table[0, {nn}]; Do[n = p*q - p - q; If[p <= q && 0 < n <= nn, t[[n]]++], {p, ps}, {q, ps}]; Join[{1}, t] (* _T. D. Noe_, Dec 05 2012 *)
%o (PARI) A157187(n)=local(c=0,L=sqrtint(n++)); fordiv( n,d, d>L && break; isprime(d+1) && isprime(n/d+1) && c++);c
%Y Cf. A218862.
%K nonn
%O 0,4
%A _M. F. Hasler_, Mar 11 2009