OFFSET
1,1
MATHEMATICA
f[n_] := PrimePi[3n] - PrimePi[2n]; t = Split[ Sort[ Table[ f[n], {n, 14000}] ]]; Flatten[ Select[t, Length[ # ] == 1 &]] (* Robert G. Wilson v, Feb 10 2005 *)
PROG
(PARI) bet2n3n(n)={ my(b=vecsort( vector(n, x, my(c=0); forprime(y=2*x+1, 3*x-1, c++); c))); for(x=1, n-2, if(b[x+1]>b[x] && b[x+1]<b[x+2], print1(b[x+1]", ")))} \\ Probably using A289493 and/or primepi(3n)-primepi(2n) would be faster. Edited and corrected by M. F. Hasler, Sep 29 2019
(PARI) \\ Size of vector dependent on how pessimistic one is on smoothness of primepi
primecount(a, b)=primepi(b)-primepi(a);
v=vector(14000);
for(k=1, oo, j=primecount(2*k, 3*k); if(j>#v, break, v[j]++));
for(k=1, 1311, if(v[k]==1, print1(k, ", "))) \\ Hugo Pfoertner, Sep 29 2019
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Cino Hilliard, Jan 29 2005
EXTENSIONS
More terms from Robert G. Wilson v, Feb 10 2005
Name edited by M. F. Hasler, Sep 29 2019
STATUS
approved