OFFSET
1,1
COMMENTS
Note that the definition here is subtly different from that of A092063.
MAPLE
count:= 0:
S:= 0: p:= 0;
for n from 1 to 2500 do
p:= nextprime(p);
S:= S + 1/(p - n);
if isprime(numer(S)) then
count:= count+1;
A[count]:= n;
fi
od:
seq(A[i], i=1..count); # Robert Israel, Sep 07 2014
MATHEMATICA
f=0; Do[ p=Prime[n]; f=f+1/(p-n); g=Numerator[f]; If[ PrimeQ[g], Print[n]], {n, 1, 500} ]
PROG
(PARI) S=1; for(n=2, 100, S=S+1/(prime(n)-n); if(isprime(numerator(S)), print1(n, ", "))) \\ Edward Jiang, Sep 08 2014
CROSSREFS
KEYWORD
nonn
AUTHOR
Mohammed Bouayoun (mohammed.bouayoun(AT)sanef.com), Feb 20 2004; corrected Apr 24 2006
EXTENSIONS
Sequence and Mathematica program corrected by Alexander Adamchuk, Jul 29 2007
a(30)-a(34) from Vincenzo Librandi, Nov 26 2012
a(35)-a(36) from Robert Israel, Sep 07 2014
a(37)-a(53) from Michael S. Branicky, Aug 26 2024
STATUS
approved