|
Search: id:A092064
|
|
| |
| |
|
|
OFFSET
|
1,1
|
|
|
PROGRAM
|
(PARI) f(n)= s=0; for(i=1, n, s=s+1/(prime(i)-1)); return(s); for (i=1, 500, if(isprime(f(i) && isprime(numerator(f(i))), print1(i, ", ")));
|
|
CROSSREFS
|
Adjacent sequences: A092061 A092062 A092063 this_sequence A092065 A092066 A092067
Sequence in context: A005382 A113165 A128025 this_sequence A091410 A122724 A033844
|
|
KEYWORD
|
hard,nonn
|
|
AUTHOR
|
Mohammed Bouayoun (mohammed.bouayoun(AT)sanef.com), Feb 20 2004
|
|
|
Search completed in 0.002 seconds
|
