|
Search: id:A092062
|
|
|
| A092062 |
|
Numbers n such that numerator of (sum(i=1,n,1/prime(i)^2)) is prime. |
|
+0
2
|
| |
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
a(6)>447 for a(6) the numerator has more than 2673 digits
|
|
FORMULA
|
Numbers n such that numerator of (sum(i=1, n, 1/prime(i)^2)) is prime
|
|
EXAMPLE
|
1/2^2=1/4
1/2^2 +1/3^2 = 13/36 and 13 is prime than a(1)=2
|
|
PROGRAM
|
(PARI) sm(n)= s=0; for(i=1, n, s=s+1/(prime(i)^2)); return(s); for (i=1, 400, if(isprime(numerator(sm(i))), print1(i, ", ")))
|
|
CROSSREFS
|
Sequence in context: A028413 A082969 A018227 this_sequence A134251 A055260 A156446
Adjacent sequences: A092059 A092060 A092061 this_sequence A092063 A092064 A092065
|
|
KEYWORD
|
hard,nonn
|
|
AUTHOR
|
mohammed Bouayoun (mohammed.bouayoun(AT)sanef.com), Feb 20 2004
|
|
|
Search completed in 0.002 seconds
|
